Iterative methods for large convex quadratic programs: a survey
SIAM Journal on Control and Optimization
Normal maps inducted by linear transformations
Mathematics of Operations Research
A non-interior-point continuation method for linear complementarity problems
SIAM Journal on Matrix Analysis and Applications
Some Noninterior Continuation Methods for LinearComplementarity Problems
SIAM Journal on Matrix Analysis and Applications
Matrix computations (3rd ed.)
Mathematics of Operations Research
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Mathematics of Computation
Computational Optimization and Applications
Convex programming with single separable constraint and bounded variables
Computational Optimization and Applications
Hi-index | 0.00 |
We propose a non-interior path following algorithm for convex quadratic programming problems with bound constraints based on Chen-Harker-Kanzow-Smale smoothing technique. Conditions are given under which the algorithm is globally convergent or globally linearly convergent. Preliminary numerical experiments indicate that the method is promising.