Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- 11 May 2012
- journal article
- Published by Springer Nature in Numerical Algorithms
- Vol. 62 (2) , 289-306
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A polynomial-time algorithm for linear optimization based on a new class of kernel functionsJournal of Computational and Applied Mathematics, 2009
- A new primal-dual interior-point algorithm for convex quadratic optimizationJournal of Shanghai University (English Edition), 2008
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic ProgrammingSIAM Journal on Optimization, 2006
- A new primal-dual path-following method for convex quadratic programmingComputational and Applied Mathematics, 2006
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear OptimizationSIAM Journal on Optimization, 2004
- Self-regular functions and new search directions for linear and semidefinite optimizationMathematical Programming, 2002
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite BarrierSIAM Journal on Optimization, 2002
- Steplengths in interior-point algorithms of quadratic programmingOperations Research Letters, 1999
- Primal-Dual Interior-Point Methods1997
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 1989