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.
2011
2011
The practical applications of 3D model acquisition are manifold. In this paper, we present our RGB-D SLAM system, i.e., an… 
2011
2011
All material supplied via JYX is protected by copyright and other intellectual property rights, and duplication or sale of all or… 
2011
2011
For the design of an Interior Permanent Magnet (IPM) motor with small torque ripple and large driving torque, the optimal design… 
2010
2010
We present a novel algorithm, Random Conic Pursuit, that solves semidefinite programs (SDPs) via repeated optimization over… 
2008
2008
† Department of Mathematical Science, Shahrekord University, P.O. Box 115, Shahrekord, Iran ♣ Department of Mathematics, Shanghai… 
2008
2008
This paper concerns some numerical stability issues of factorizations in interior point methods. In our investigation we focus on… 
2000
2000
A gridgeneration method based on the minimization of a barrier functional with a feasible set consisting of quasi-isometric grids… 
1996
1996
It is well known that the celebrated Kojima–Mizuno–Yoshise primal-dual interior-point method for linear programming can be viewed… 
1992
1992
An algorithm based on reducing a suitable potential function for linear programming is described. At each iteration, separate… 
1989
1989
Part 1 Theoretical perspective: the social arcade urban design role the privatization of public space. Part 2 Commercial places…