Skip to search formSkip to main contentSkip to account menu

Interior point method

Known as: Interior-point method, Interior-point methods, IPM 
Interior point methods (also referred to as barrier methods) are a certain class of algorithms that solves linear and nonlinear convex optimization… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Mean-variance mapping optimization (MVMO) is an emerging evolutionary algorithm, which adopts a single-solution based approach… 
2012
2012
The linear programming problem is usually solved through the use of one of two algorithms: either simplex, or an algorithm in the… 
2007
2007
In Roos [Roos, C., 2006, A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM Journal on… 
Highly Cited
2006
Highly Cited
2006
We have developed the high‐resolution auto‐stereoscopic 3D display for the first time in the world. For this, we suggested time… 
2005
2005
To model the combustion of long-chain hydrocarbon fuels, an accurate kinetics mechanism must first be developed for the oxidation… 
2003
2003
We propose and analyze a primal-dual interior point method of the “feasible” type, with the additional property that the… 
Highly Cited
1995
Highly Cited
1995
In this paper we present new global convergence results on a long-step affine scaling algorithm obtained by means of the local… 
Highly Cited
1991
Highly Cited
1991
An interior point method for block angular optimization is developed and the convergence properties of the method are described… 
1985
1985
The absorbing barrier method for using molecular dynamics to determine rate constants for activated barrier crossing is…