A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints

DOI10.3934/naco.2015.5.115zbMath1317.90288OpenAlexW2525564172MaRDI QIDQ2353465

Jian-Ling Li, Chunting Lu, You-fang Zeng

Publication date: 14 July 2015

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2015.5.115

zbMATH Keywords

global convergencecomplementarity constraintsmathematical programsfilter-freepenalty-function-freeQP-free

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
• A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
• Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• A smoothing method for mathematical programs with equilibrium constraints
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
• 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 modified relaxation scheme for mathematical programs with complementarity constraints
• A penalty-free method with line search for nonlinear equality constrained optimization
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints
• A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
• A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
• A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
• An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Equilibrium Constraints

This page was built for publication: A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints