Trajectory-following methods for large-scale degenerate convex quadratic programming
- 16 February 2013
- journal article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 5 (2) , 113-142
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity ProblemsSIAM Journal on Optimization, 2008
- Further development of multiple centrality correctors for interior point methodsComputational Optimization and Applications, 2007
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central pathOptimization Methods and Software, 2005
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- A repository of convex quadratic programming problemsOptimization Methods and Software, 1999
- The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problemsOptimization Methods and Software, 1998
- Equivaence between different formulations of the linear complementarity promblemOptimization Methods and Software, 1997
- The design of MA48ACM Transactions on Mathematical Software, 1996
- Interior methods for constrained optimizationActa Numerica, 1992
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991