Relaxation approaches for nonlinear sparse optimization problems

DOI10.1080/02331934.2023.2282176MaRDI QIDQ6618213

Publication date: 14 October 2024

Published in: Optimization (Search for Journal in Brave)

Mixed integer programming (90C11) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

Unnamed Item
Relaxation approach for equilibrium problems with equilibrium constraints
Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
A mathematical introduction to compressive sensing
Algorithm for cardinality-constrained quadratic optimization
A smoothing method for mathematical programs with equilibrium constraints
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
An augmented Lagrangian method for cardinality-constrained optimization problems
Structural properties of affine sparsity constraints
Characterization of strong stability for C-stationary points in MPCC
Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
Directional derivative of the marginal function in nonlinear programming
Some properties of regularization and penalization schemes for MPECs
Solving quadratic multi-leader-follower games by smoothing the follower's best response
MPCC: Critical Point Theory
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method

This page was built for publication: Relaxation approaches for nonlinear sparse optimization problems