The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints

DOI10.3934/jimo.2018032zbMath1415.90122OpenAlexW2800025289WikidataQ129720482 ScholiaQ129720482MaRDI QIDQ2423272

Na Xu, Jian Lv, Li-Ping Pang

Publication date: 21 June 2019

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

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

zbMATH Keywords

convergenceconstraint qualificationmathematical program with vertical complementarity constraintsC-/M-stationarityinexact KKT pointsinexact regularization method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Uses Software

• Matlab
• SNOPT
• Ipopt

Cites Work

• Unnamed Item
• On the multiplier-penalty-approach for quasi-variational inequalities
• A log-exponential regularization method for a mathematical program with general vertical complementarity constraints
• A log-exponential smoothing method for mathematical programs with complementarity constraints
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints
• Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
• Foundations of optimization
• Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints
• A modified relaxation scheme for mathematical programs with complementarity constraints
• A generalization of the Nash equilibrium theorem on bimatrix games
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• A non-interior continuation method for generalized linear complementarity problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
• A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
• On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
• Nonlinear programming without a penalty function.

This page was built for publication: The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints