A locally smoothing method for mathematical programs with complementarity constraints

DOI10.1017/S1446181115000048MaRDI QIDQ5252111zbMATH OpenOpenAlexFDO

Authors Yu Chen, Zhong Wan

Publication date 29 May 2015

Published in The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1446181115000048

zbMATH Keywords

constraints qualificationconvergencemathematical programs with complementarity constraintsstationary point

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

Recommendations

• A smoothing method for mathematical programs with complementarity constraints
• A new smoothing method for mathematical programs with complementarity constraints
• A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
• A new smoothing scheme for mathematical programs with complementarity constraints
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints

Cites work

• A class of smoothing methods for mathematical programs with complementarity constraints
• A log-exponential smoothing method for mathematical programs with complementarity constraints
• A modified projected conjugate gradient algorithm for unconstrained optimization problems
• A modified relaxation scheme for mathematical programs with complementarity constraints
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
• A new smoothing scheme for mathematical programs with complementarity constraints
• A smoothing method for mathematical programs with equilibrium constraints
• An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
• Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Lifting mathematical programs with complementarity constraints
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• New BFGS method for unconstrained optimization problem based on modified armijo line search
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Partial exact penalty for mathematical programs with equilibrium constraints
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

Cited in

(7)

• A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
• A partially smoothing Jacobian method for nonlinear complementarity problems with P₀ function
• Bi-level programming approach to optimal strategy for vendor-managed inventory problems under random demand
• Optimal decision making for online and offline retailers under BOPS mode
• Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
• Partially smoothing and gradient-based algorithm for optimizing the VMI system with competitive retailers under random demands
• Lifting mathematical programs with complementarity constraints

This page was built for publication: A locally smoothing method 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 Q5252111)