Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
Journal Article
·
· SIAM Journal on Optimization
- Technische Univ. Braunschweig (Germany)
- Argonne National Lab. (ANL), Lemont, IL (United States)
- Argonne National Lab. (ANL), Lemont, IL (United States); Technische Univ. Dortmund (Germany)
Here, we propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set. The algorithm enforces descent on the objective function to promote global convergence to B-stationary points. We provide a convergence analysis and preliminary numerical results on a range of test problems. We also study the effect of fixing the active constraints in a bound-constrained quadratic program that can be solved on each iteration in order to obtain fast convergence.
- Research Organization:
- Argonne National Laboratory (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- Deutsche Forschungsgemeinschaft (DFG); German Federal Ministry of Education and Research (BMBF); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR). Scientific Discovery through Advanced Computing (SciDAC)
- Grant/Contract Number:
- AC02-06CH11357
- OSTI ID:
- 1969125
- Journal Information:
- SIAM Journal on Optimization, Journal Name: SIAM Journal on Optimization Journal Issue: 1 Vol. 32; ISSN 1052-6234
- Publisher:
- Society for Industrial and Applied Mathematics (SIAM)Copyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions
A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints
Global methods for nonlinear complementarity problems
Journal Article
·
Fri Dec 14 23:00:00 EST 2007
· Applied Mathematics and Optimization
·
OSTI ID:21064181
A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints
Journal Article
·
Thu Jun 15 00:00:00 EDT 2006
· Applied Mathematics and Optimization
·
OSTI ID:21064208
Global methods for nonlinear complementarity problems
Technical Report
·
Thu Mar 31 23:00:00 EST 1994
·
OSTI ID:204261