A spectral gradient projection method for the positive semi-definite procrustes problem
From MaRDI portal
Publication:5029398
Abstract: This paper addresses the positive semi-definite procrustes problem (PSDP). The PSDP corresponds to a least squares problem over the set of symmetric and semi-definite positive matrices. These kinds of problems appear in many applications such as structure analysis, signal processing, among others. A non-monotone spectral projected gradient algorithm is proposed to obtain a numerical solution for the PSDP. The proposed algorithm employs the Zhang and Hager's non-monotone technique in combination with the Barzilai and Borwein's step size to accelerate convergence. Some theoretical results are presented. Finally, numerical experiments are performed to demonstrate the effectiveness and efficiency of the proposed method, and comparisons are made with other state-of-the-art algorithms.
Recommendations
Cites work
- A competitive error in variables approach and algorithms for finding positive definite solutions of linear systems of matrix equations
- A Constrained Procrustes Problem
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A semi-analytical approach for the positive semidefinite Procrustes problem
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
- Computing a nearest symmetric positive semidefinite matrix
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- scientific article; zbMATH DE number 1932411 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\)
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- Optimal matrices describing linear systems.
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(8)- Proximal point algorithm with Schur decomposition on the cone of symmetric semidefinite positive matrices
- A semi-analytical approach for the positive semidefinite Procrustes problem
- On the non-symmetric semidefinite Procrustes problem
- A fixed-point method for approximate projection onto the positive semidefinite cone
- Implicit steepest descent algorithm for optimization with orthogonality constraints
- A method for weighted projections to the positive definite cone
- The proximal point iterative algorithm for the generalized positive semidefinite least squares problem
- Gradient Flows for Probabilistic Frame Potentials in the Wasserstein Space
This page was built for publication: A spectral gradient projection method for the positive semi-definite procrustes problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5029398)
