An efficient algorithm for solving a class of matrix optimization problem in scalable probabilistic approximation
From MaRDI portal
Publication:6624116
DOI10.12386/a20220054MaRDI QIDQ6624116
Xue-Feng Duan, Jiao-Fen Li, Xuelin Zhou, Ke-Yang Wei
Publication date: 25 October 2024
Published in: Acta Mathematica Sinica. Chinese Series (Search for Journal in Brave)
product manifoldmatrix optimization problemRiemannian conjugate gradient methodscalable probabilistic approximation
Cites Work
- A feasible method for optimization with orthogonality constraints
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A Riemannian inexact Newton-CG method for constructing a nonnegative matrix with prescribed realizable spectrum
- Riemannian optimal model reduction of linear port-Hamiltonian systems
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Hybrid Riemannian conjugate gradient methods with global convergence properties
- Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- A Riemannian under-determined BFGS method for least squares inverse eigenvalue problems
- A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils
- A geometric Gauss-Newton method for least squares inverse eigenvalue problems
- A brief introduction to manifold optimization
- Riemannian inexact Newton method for structured inverse eigenvalue and singular value problems
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A Riemannian Fletcher--Reeves Conjugate Gradient Method for Doubly Stochastic Inverse Eigenvalue Problems
- Manopt, a Matlab toolbox for optimization on manifolds
- Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
- Joint singular value decomposition algorithm based on the Riemannian trust-region method
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- The Geometry of Algorithms with Orthogonality Constraints
- Numerical Optimization
- Riemannian Optimal Control and Model Matching of Linear Port-Hamiltonian Systems
- Structure-Preserving $H^2$ Optimal Model Reduction Based on the Riemannian Trust-Region Method
- ROPTLIB
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A trust‐region method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils
- Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques
- Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data*
- Riemannian Optimization and Its Applications
- A new, globally convergent Riemannian conjugate gradient method
- A Riemannian Optimization Approach to the Matrix Singular Value Decomposition
- An Extrinsic Look at the Riemannian Hessian
- A Geometric Nonlinear Conjugate Gradient Method for Stochastic Inverse Eigenvalue Problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: An efficient algorithm for solving a class of matrix optimization problem in scalable probabilistic approximation