An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
From MaRDI portal
(Redirected from Publication:2148144)
Abstract: In this paper, the optimization problem of the supervised distance preserving projection (SDPP) for data dimension reduction (DR) is considered, which is equivalent to a rank constrained least squares semidefinite programming (RCLSSDP). In order to overcome the difficulties caused by rank constraint, the difference-of-convex (DC) regularization strategy was employed, then the RCLSSDP is transferred into a series of least squares semidefinite programming with DC regularization (DCLSSDP). An inexact proximal DC algorithm with sieving strategy (s-iPDCA) is proposed for solving the DCLSSDP, whose subproblems are solved by the accelerated block coordinate descent (ABCD) method. Convergence analysis shows that the generated sequence of s-iPDCA globally converges to stationary points of the corresponding DC problem. To show the efficiency of our proposed algorithm for solving the RCLSSDP, the s-iPDCA is compared with classical proximal DC algorithm (PDCA) and the PDCA with extrapolation (PDCAe) by performing DR experiment on the COIL-20 database, the results show that the s-iPDCA outperforms the PDCA and the PDCAe in solving efficiency. Moreover, DR experiments for face recognition on the ORL database and the YaleB database demonstrate that the rank constrained kernel SDPP (RCKSDPP) is effective and competitive by comparing the recognition accuracy with kernel semidefinite SDPP (KSSDPP) and kernal principal component analysis (KPCA).
Recommendations
- Supervised dimensionality reduction via sequential semidefinite programming
- Supervised distance preserving projection using alternating direction method of multipliers
- An efficient method for convex constrained rank minimization problems based on DC programming
- On a DC-optimization-problem from statistical factor analysis
- The problem of semidefinite least squares with low rank
Cites work
- scientific article; zbMATH DE number 517393 (Why is no real title available?)
- A boundary point method to solve semidefinite programs
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- A proximal DC approach for quadratic assignment problem
- A proximal difference-of-convex algorithm with extrapolation
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- A remark on global positioning from local distances
- An Invitation to Tame Optimization
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An efficient inexact ABCD method for least squares semidefinite programming
- An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC formulations and algorithms for sparse optimization problems
- Error bounds for rank constrained optimization problems and applications
- Exact penalty and error bounds in DC programming
- Exact penalty in d. c. programming
- First-order methods in optimization
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Multidimensional scaling. I: Theory and method
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Penalty decomposition methods for rank minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal bundle methods for nonsmooth DC programming
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The computational complexity of some problems of linear algebra
- The restricted isometry property and its implications for compressed sensing
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
Cited in
(5)- Supervised dimensionality reduction via sequential semidefinite programming
- 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
- Supervised distance preserving projection using alternating direction method of multipliers
- An efficient method for convex constrained rank minimization problems based on DC programming
This page was built for publication: An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148144)
