A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints

DOI10.1007/s10898-004-2708-5zbMath1097.90063OpenAlexW1984345213MaRDI QIDQ816061

Jian-Ling Li, Jin-Bao Jian

Publication date: 20 February 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-2708-5

zbMATH Keywords

algorithmglobal convergencesuperlinear convergencecomplementarity constraintssequential systems of linear equations

Mathematics Subject Classification ID

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

Related Items (6)

An infeasible nonmonotone SSLE algorithm for nonlinear programming ⋮ 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 QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints

Cites Work

• A smoothing method for mathematical programs with equilibrium constraints
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• On optimization of systems governed by implicit complementarity problems^*
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• Some Noninterior Continuation Methods for Linear Complementarity Problems

This page was built for publication: A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints