A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
From MaRDI portal
Publication:1383834
DOI10.1023/A:1018359900133zbMath0904.90153MaRDI QIDQ1383834
Masao Fukushima, Zhi-Quan Luo, Jong-Shi Pang
Publication date: 19 January 1999
Published in: Computational Optimization and Applications (Search for Journal in Brave)
global convergence; linear complementarity; sequential quadratic programming; mathematical programs with equilibrium constraints
90C30: Nonlinear programming
Related Items
On the global minimization of the value-at-risk, Exact penalty functions for convex bilevel programming problems., A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints, A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints, A continuation method for (strongly) monotone variational inequalities, New relaxation method for mathematical programs with complementarity constraints, A three-dimension null-space approach for mathematical programs with equilibrium constraints., Further investigation on feasibility of mathematical programs with equilibrium constraints, Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation, DC programming: overview.
