A Path-Based Approach to Constrained Sparse Optimization

DOI10.1137/22M1535498OpenAlexW4391998833MaRDI QIDQ6202768FDOQ6202768

Authors: 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

Recommendations

• On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
• Sparsity constrained optimization problems via disjunctive programming
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• A unifying framework for sparsity-constrained optimization
• Concave programming for finding sparse solutions to problems with convex constraints

zbMATH Keywords

nonconvex optimizationsparse optimizationconditional gradientpath optimality

Mathematics Subject Classification ID

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

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The elements of statistical learning. Data mining, inference, and prediction
• Atomic Decomposition by Basis Pursuit
• Variational Analysis
• Regression modeling strategies. With applications to linear models, logistic regression, and survival analysis
• First-order methods in optimization
• Title not available (Why is that?)
• Decoding by Linear Programming
• Convex Analysis
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Compressed sensing
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
• A method for solving traveling-salesman problems
• On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
• Title not available (Why is that?)
• Convex analysis and nonlinear optimization. Theory and examples.
• The sparse principal component analysis problem: optimality conditions and algorithms
• Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
• Structured Compressed Sensing: From Theory to Applications
• Convex Analysis on the Hermitian Matrices
• Title not available (Why is that?)
• A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
• New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
• Proximal mapping for symmetric penalty and sparsity
• A Scalable Algorithm for Sparse Portfolio Selection
• Sparse Portfolios for High-Dimensional Financial Index Tracking
• The landscape of empirical risk for nonconvex losses
• Optimization problems involving group sparsity terms

Cited In (1)

• Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202768)