A three-dimension null-space approach for mathematical programs with equilibrium constraints.

DOI10.1016/S0096-3003(03)00079-1zbMath1045.90072WikidataQ57806940 ScholiaQ57806940MaRDI QIDQ1427909

D. Massart

Publication date: 14 March 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Complementarity constraintsConvergeMathematical programs with equilibrium constraints (MPECs)Null-space methods

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Review of formulations for structural and mechanical system optimization, Dynamic feedback Stackelberg games with non-unique solutions

Cites Work

• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• New relaxation method for mathematical programs with complementarity constraints
• An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
• A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
• Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
• On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
• A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• The penalty interior-point method fails to converge
• A trust region method based on interior point techniques for nonlinear programming.