Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Journal Article · · SIAM Journal on Optimization
DOI:https://doi.org/10.1137/20m1370501· OSTI ID:1969125

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

References (26)

Nonlinear programming and nonsmooth optimization by successive linear programming journal January 1989
Complementary pivot theory of mathematical programming journal January 1968
An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs) journal January 2005
Nonlinear programming and nonsmooth optimization by successive linear programming journal January 1989
Large-scale linearly constrained optimization journal December 1978
Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization journal April 1996
On the global convergence of an SLP-filter algorithm that takes EQP steps journal April 2003
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming journal April 2005
An adaptive augmented Lagrangian method for large-scale constrained optimization journal April 2014
Nonlinear programming without a penalty function journal January 2002
Abadie-Type Constraint Qualification for Mathematical Programs with Equilibrium Constraints journal March 2005
Complementarity Active-Set Algorithm for Mathematical Programming Problems with Equilibrium Constraints journal July 2007
Solving mathematical programs with complementarity constraints as nonlinear programs journal February 2004
Improving ultimate convergence of an augmented Lagrangian method journal April 2008
A pivoting algorithm for linear programming with linear complementarity constraints journal February 2012
Interior Methods for Mathematical Programs with Complementarity Constraints journal January 2006
On the Global Solution of Linear Programs with Linear Complementarity Constraints journal January 2008
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization journal January 2005
Exact Penalization of Mathematical Programs with Equilibrium Constraints journal January 1999
On the Global Convergence of a Filter--SQP Algorithm journal January 2002
Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints journal January 2006
A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization journal January 2005
An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs) journal January 2005
Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers journal January 1999
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints journal January 2002
Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints journal August 1999

Similar Records

A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions
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