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

DOI10.3934/NACO.2015.5.115MaRDI QIDQ2353465zbMATH OpenOpenAlexFDO

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

Publication date 14 July 2015

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

complementarity constraintsfilter-freeglobal convergencemathematical programspenalty-function-freeQP-free

Mathematics Subject Classification ID

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

Recommendations

• A new QP-free algorithm for mathematical programs with nonlinear complementarity constraints
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
• A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
• A global QP-free algorithm for mathematical programs with complementarity constraints
• An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
• A strong global convergent QP-free algorithm for mathematical programming with nonlinear complementary constraints
• Smooth SQP algorithm for mathematical programs with implicit complementarity constraints
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• A new QP-free algorithm for inequality constrained optimization without strict complementarity
• A nonmonotone QP-free method without a penalty function and a filter

Cites work

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

Cited in

(3)

• A global QP-free algorithm for mathematical programs with complementarity constraints
• A Filter algorithm for solving mathematical programming with linear complementarity constraints
• A generalized gradient projection penalty algorithm for mathematical programming problems with complementarity 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353465)