Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints

DOI10.1007/S10957-024-02475-6MaRDI QIDQ6614711zbMATH OpenFDO

Authors Lei Guo, Gaoxi Li

Publication date 7 October 2024

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-024-02475-6

zbMATH Keywords

mathematical program with equilibrium constraintsnon-Lipschitz continuitynonconvex optimizationregularization methodsmoothing functionsparsity-inducing penalty

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
• scientific article; zbMATH DE number 1086742
• A superlinear convergent smooth SQP algorithm for mathematical programs with nonlinear equilibrium constraints
• New constraint qualifications for S-stationarity for MPEC with nonsmooth objective
• scientific article

Cites work

• A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
• A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
• A new regularization scheme for mathematical programs with complementarity constraints
• A relaxed constant positive linear dependence constraint qualification and applications
• A smoothing method for a mathematical program with P-matrix linear complementarity constraints
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
• Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
• Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Global convergence of augmented Lagrangian methods applied to optimization problems with degenerate constraints, including problems with complementarity constraints
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
• Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
• Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
• Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints
• New relaxation method for mathematical programs with complementarity constraints
• New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences
• Nonconvex TV^q-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
• Notes on some constraint qualifications for mathematical programs with equilibrium constraints
• Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
• Sparse solutions of linear complementarity problems
• Stability analysis for parametric mathematical programs with geometric constraints and its applications
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization

This page was built for publication: Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints

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