A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
From MaRDI portal
Publication:2432613
DOI10.1007/s00245-005-0848-8zbMath1136.90514OpenAlexW2146837357MaRDI QIDQ2432613
Jian-Ling Li, Xing-De Mo, Jin-Bao Jian
Publication date: 25 October 2006
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-005-0848-8
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Related Items
A new method for solving multiobjective bilevel programs, A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization, Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map, A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function, A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints, A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints