Exterior-point optimization for sparse and low-rank optimization
From MaRDI portal
Recommendations
- Preface
- The non-convex geometry of low-rank matrix optimization
- Models and algorithms for low-rank and sparse matrix optimization problems
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
- Provable accelerated gradient method for nonconvex low rank optimization
Cites work
- A general system for heuristic minimization of convex functions over non-convex sets
- A primer on monotone operator methods
- A Scalable Algorithm for Sparse Portfolio Selection
- Best subset selection via a modern optimization lens
- Certifiably optimal low rank factor analysis
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Characterization of Lower Semicontinuous Convex Functions
- Characterizing firm nonexpansiveness of prox mappings both locally and globally
- Convex analysis and monotone operator theory in Hilbert spaces
- Deep learning
- Diagonal and low-rank matrix decompositions, correlation matrices, and ellipsoid fitting
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact matrix completion via convex optimization
- Existence and Differentiability of Metric Projections in Hilbert Spaces
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- First-order methods in optimization
- Generalized low rank models
- Hard thresholding pursuit: an algorithm for compressive sensing
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 823375 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Iterative thresholding for sparse approximations
- JuMP: a modeling language for mathematical optimization
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- LLORMA: local low-rank matrix approximation
- Local differentiability of distance functions
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Non-convex optimization for machine learning
- Prox-regular functions in variational analysis
- Prox-regular sets and epigraphs in uniformly convex Banach spaces: various regularities and other properties
- Prox-regularity of rank constraint sets and implications for algorithms
- Smooth minimization of non-smooth functions
- Sparse hierarchical regression with polynomials
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Spectral regularization algorithms for learning large incomplete matrices
- Stability in Mathematical Programming with Nondifferentiable Data
- Strong and Weak Convexity of Sets and Functions
- The elements of statistical learning. Data mining, inference, and prediction
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
Cited in
(2)
This page was built for publication: Exterior-point optimization for sparse and low-rank optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608755)
