DOE OSTI · 1969125
Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kirches, Christian, Larson, Jeffrey, Leyffer, Sven, Manns, Paul. 2022-01-05. Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints. https://doi.org/10.1137/20m1370501. https://searchnasa.com/record/osti%3A1969125/sequential-linearization-method-for-bound-constrained-mathematical-programs-with-complementarity-con
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.