Proximal penalty method for sparse optimization with complementarity constraints
From MaRDI portal
Cites work
- A dynamic system approach to quadratic programming problems with penalty method
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A new regularization scheme for mathematical programs with complementarity constraints
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A penalty method for a mixed nonlinear complementarity problem
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- An iterative explicit algorithm for solving equilibrium problems in Banach spaces
- Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Lifted stationary points of sparse optimization with complementarity constraints
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
- On penalty method for equilibrium problems in lexicographic order
- 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
This page was built for publication: Proximal penalty method for sparse optimization with complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231715)