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

DOI10.1007/S10957-024-02475-6MaRDI QIDQ6614711

Lei Guo, Gaoxi Li

Publication date: 7 October 2024

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

zbMATH Keywords

nonconvex optimizationregularization methodmathematical program with equilibrium constraintssmoothing functionnon-Lipschitz continuitysparsity-inducing penalty

Mathematics Subject Classification ID

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

Cites Work

• Sparse solutions of linear complementarity problems
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• A relaxed constant positive linear dependence constraint qualification and applications
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
• Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
• New relaxation method for mathematical programs with complementarity constraints
• A smoothing method for a mathematical program with P-matrix linear complementarity constraints
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Notes on some constraint qualifications for mathematical programs with equilibrium constraints
• Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
• Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints
• Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
• Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
• Nonconvex TV\(^q\)-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Stability Analysis for Parametric Mathematical Programs with Geometric Constraints and Its Applications
• Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
• Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
• A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods
• A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
• New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
• Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
• Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences

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)