Class of methods for solving large convex quadratic programs subject to box constraints
Thesis/Dissertation
·
OSTI ID:5315635
Large sparse convex quadratic programs subject only to box constraints (i.e., lower and upper bounds on the variables), called BQP, play an important role in large scale nonlinear optimization. The dual of a large strictly convex quadratic program (subject to general constraints) is a special case of BQP, and such generally-constrained quadratic programs need to be solved efficiently in using the popular Sequential Quadratic Programming methods for solving large nonlinear programs. A conjugate gradient-type heuristic algorithm and a new class of finite algorithms based on such a heuristic were studied. The numerical results with Dembo and Tulowitzki's CRGP algorithm in general and perform better than CRGP for problems that have a low percentage of free variables at optimality. An SSOR preconditioning was also used to improve the efficiency of the heuristic algorithm.
- Research Organization:
- North Carolina Univ., Chapel Hill (USA)
- OSTI ID:
- 5315635
- Country of Publication:
- United States
- Language:
- English
Similar Records
Block strategies in active-set algorithms for quadratic programming with box constraints
Non-convex quadratic programming
Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36001
Non-convex quadratic programming
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35833
Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
Journal Article
·
Mon Feb 10 19:00:00 EST 2020
· INFORMS Journal on Computing
·
OSTI ID:1688736