Exterior-point optimization for sparse and low-rank optimization
From MaRDI portal
Publication:6608755
DOI10.1007/s10957-024-02448-9zbMath1547.65059MaRDI QIDQ6608755
Bartolomeo Stellato, Shuvomoy Das Gupta, Bart P. G. Van Parys
Publication date: 20 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Smooth minimization of non-smooth functions
- Best subset selection via a modern optimization lens
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sparse hierarchical regression with polynomials
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- Prox-regularity of rank constraint sets and implications for algorithms
- Exact matrix completion via convex optimization
- Generalized Low Rank Models
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Prox-regular sets and epigraphs in uniformly convex Banach spaces: Various regularities and other properties
- Strong and Weak Convexity of Sets and Functions
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Stability in Mathematical Programming with Nondifferentiable Data
- Implicit Functions and Solution Mappings
- Characterization of Lower Semicontinuous Convex Functions
- Existence and Differentiability of Metric Projections in Hilbert Spaces
- Local differentiability of distance functions
- First-Order Methods in Optimization
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- A general system for heuristic minimization of convex functions over non-convex sets
- Non-convex Optimization for Machine Learning
- Prox-regular functions in variational analysis
- Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- A Scalable Algorithm for Sparse Portfolio Selection
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Certifiably Optimal Low Rank Factor Analysis
- JuMP: A Modeling Language for Mathematical Optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Exterior-point optimization for sparse and low-rank optimization