Critical point theory for sparse recovery

DOI10.1080/02331934.2021.1981317OpenAlexW3201876985MaRDI QIDQ5880388

No author found.

Publication date: 9 March 2023

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.10913

zbMATH Keywords

critical point theorystrong stabilitysparse recoverycompressed sensingnondegenerate M-stationarity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Mathematical programs with vanishing constraints: critical point theory
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
• On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
• Characterization of strong stability for C-stationary points in MPCC
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• General semi-infinite programming: critical point theory
• Proximal Mapping for Symmetric Penalty and Sparsity
• MPCC: Critical Point Theory
• Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method

This page was built for publication: Critical point theory for sparse recovery