A smoothing Newton algorithm for mathematical programs with complementarity constraints

DOI10.3934/JIMO.2005.1.153MaRDI QIDQ1780125zbMATH OpenOpenAlexFDO

Authors Zhenghai Huang, Jie Sun

Publication date 7 June 2005

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/jimo.2005.1.153

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A new smoothing method for mathematical programs with complementarity constraints
• A smoothing method for mathematical programs with complementarity constraints
• A new smoothing scheme for mathematical programs with complementarity constraints
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
• Superlinear convergence of a smooth approximation method for mathematical programs with nonlinear complementarity constraints

Cited in

(13)

• A new smoothing scheme for mathematical programs with complementarity constraints
• An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
• A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
• Newton-type method for a class of mathematical programs with complementarity constraints
• A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
• Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations
• A new smoothing method for mathematical programs with complementarity constraints
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• Hybrid approach with active set identification for mathematical programs with complementarity constraints
• Superlinear convergence of a smooth approximation method for mathematical programs with nonlinear complementarity constraints
• Feasibility problems with complementarity constraints
• A constrained nonlinear system approach for the solution of an extended limit analysis problem
• A non-monotone line search algorithm for unconstrained optimization

This page was built for publication: A smoothing Newton algorithm 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 Q1780125)