An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
- 8 February 2022
- journal article
- research article
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 90 (3) , 1-31
Abstract
No abstract availableKeywords
This publication has 58 references indexed in Scilit:
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- A projected-steepest-descent potential-reduction algorithm for convex programming problemsNumerical Linear Algebra with Applications, 2004
- Non-Interior continuation methods for solving semidefinite complementarity problemsMathematical Programming, 2003
- A combination of potential reduction steps and steepest descent steps for solving convex programming problemsNumerical Linear Algebra with Applications, 2002
- Penalty/barrier path-following in linearly constrained optimizationDiscussiones Mathematicae Differential Inclusions, Control and Optimization, 2000
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniquesMathematical Programming, 1999
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problemsMathematics of Computation, 1999
- Asymptotic analysis of a path-following barrier method for linearly constrained convex problems*Optimization, 1999
- A simplified global convergence proof of the affine scaling algorithmAnnals of Operations Research, 1993
- An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problemPacific Journal of Mathematics, 1980