A Path-Based Approach to Constrained Sparse Optimization

DOI10.1137/22m1535498OpenAlexW4391998833MaRDI QIDQ6202768

Nadav Hallak

Publication date: 27 February 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/22m1535498

zbMATH Keywords

nonconvex optimizationsparse optimizationconditional gradientpath optimality

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The sparse principal component analysis problem: optimality conditions and algorithms
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Regression modeling strategies. With applications to linear models, logistic regression, and survival analysis
• Convex analysis and nonlinear optimization. Theory and examples.
• The landscape of empirical risk for nonconvex losses
• New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
• Optimization problems involving group sparsity terms
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Decoding by Linear Programming
• Sparse and Redundant Representations
• Atomic Decomposition by Basis Pursuit
• Variational Analysis
• Structured Compressed Sensing: From Theory to Applications
• First-Order Methods in Optimization
• Proximal Mapping for Symmetric Penalty and Sparsity
• Sparse Portfolios for High-Dimensional Financial Index Tracking
• Convex Analysis on the Hermitian Matrices
• Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
• Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
• A Scalable Algorithm for Sparse Portfolio Selection
• A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
• A Method for Solving Traveling-Salesman Problems
• Convex Analysis
• Compressed sensing
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: A Path-Based Approach to Constrained Sparse Optimization