Lifted stationary points of sparse optimization with complementarity constraints
From MaRDI portal
Publication:2696930
DOI10.1007/s10589-022-00444-1OpenAlexW4313202091MaRDI QIDQ2696930
Publication date: 17 April 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.04756
complementarity constraintssparse solutioncapped-\(\ell_1\) folded concave functionlifted stationary pointvertical linear complementarity constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse solutions of linear complementarity problems
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- New global error bound for extended linear complementarity problems
- Partial exact penalty for mathematical programs with equilibrium constraints
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- Computing B-Stationary Points of Nonsmooth DC Programs
- The Linear Complementarity Problem
- Decoding by Linear Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A New Approach to Lagrange Multipliers
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Variational Analysis
- Engineering and Economic Applications of Complementarity Problems
- Exact penalization via dini and hadamard conditional derivatives
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- MultiComposite Nonconvex Optimization for Training Deep Neural Networks
- Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function
- New Constraint Qualifications for S-Stationarity for MPEC with Nonsmooth Objective
- An MPCC approach for stochastic Stackelberg–Nash–Cournot equilibrium
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Sparse Solutions of a Class of Constrained Optimization Problems
- Mathematical Programs with Equilibrium Constraints
This page was built for publication: Lifted stationary points of sparse optimization with complementarity constraints