An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
From MaRDI portal
Publication:2148144
DOI10.1007/s10915-022-01845-4zbMath1494.90069arXiv2105.12389MaRDI QIDQ2148144
Mingcai Ding, Xiaoliang Song, Bo Yu
Publication date: 21 June 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.12389
rank constraint; data dimensionality reduction; accelerated block coordinate descent; inexact proximal difference-of-convex algorithm; sieving strategy; supervised distance preserving projection
90C22: Semidefinite programming
Related Items
A three-operator splitting algorithm with deviations for generalized DC programming, An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Exact penalty and error bounds in DC programming
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- A boundary point method to solve semidefinite programs
- The restricted isometry property and its implications for compressed sensing
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- The computational complexity of some problems of linear algebra
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Exact penalty in d. c. programming
- A proximal difference-of-convex algorithm with extrapolation
- DC formulations and algorithms for sparse optimization problems
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Error bounds for rank constrained optimization problems and applications
- A proximal DC approach for quadratic assignment problem
- Proximal bundle methods for nonsmooth DC programming
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Multidimensional scaling. I: Theory and method
- Lectures on Modern Convex Optimization
- An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- Penalty decomposition methods for rank minimization
- A remark on global positioning from local distances
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- An Invitation to Tame Optimization
- First-Order Methods in Optimization
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse Approximation via Penalty Decomposition Methods
- An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
