A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS

DOI10.1017/S1446181115000048zbMath1338.90384OpenAlexW2075872329MaRDI QIDQ5252111

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

convergencestationary pointmathematical programs with complementarity constraintsconstraints qualification

Mathematics Subject Classification ID

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

Related Items

OPTIMAL DECISION MAKING FOR ONLINE AND OFFLINE RETAILERS UNDER BOPS MODE ⋮ BI-LEVEL PROGRAMMING APPROACH TO OPTIMAL STRATEGY FOR VENDOR-MANAGED INVENTORY PROBLEMS UNDER RANDOM DEMAND ⋮ A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function

Cites Work

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