A new primal-dual interior-point algorithm for convex quadratic optimization
- 21 June 2008
- journal article
- research article
- Published by Springer Nature in Journal of Shanghai University (English Edition)
- Vol. 12 (3) , 189-196
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimizationJournal of Shanghai University (English Edition), 2006
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming2006
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear OptimizationSIAM Journal on Optimization, 2004
- A primal‐dual interior-point method for linear optimization based on a new proximity functionOptimization Methods and Software, 2002
- On a homogeneous algorithm for the monotone complementarity problemMathematical Programming, 1999
- Interior Point Algorithms1997
- Interior Point Techniques in Optimization1997
- Interior Point Approach to Linear, Quadratic and Convex Programming1994
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984