A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy

DOI10.1007/s10915-022-01962-0zbMath1500.90069OpenAlexW4293064487WikidataQ115382641 ScholiaQ115382641MaRDI QIDQ2674265

Wen Huang, Kyle A. Gallivan

Publication date: 22 September 2022

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-022-01962-0

zbMATH Keywords

matrix completionindependent component analysisblind deconvolutiontrust-regionphase retrievalRiemannian optimizationlimited-memory quasi-Newtonsymmetric rank-one

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (1)

Multivariate expectile-based distribution: properties, Bayesian inference, and applications

Uses Software

• L-BFGS
• ROPTLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
• Riemannian optimization for registration of curves in elastic shape analysis
• On solving L-SR1 trust-region subproblems
• Intrinsic representation of tangent vectors and vector transports on matrix manifolds
• On the limited memory BFGS method for large scale optimization
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• Representations of quasi-Newton matrices and their use in limited memory methods
• A geometric analysis of phase retrieval
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• A Riemannian conjugate gradient method for optimization on the Stiefel manifold
• A Riemannian symmetric rank-one trust-region method
• Trust-region methods on Riemannian manifolds
• On efficiently combining limited-memory and trust-region techniques
• A survey and comparison of contemporary algorithms for computing the matrix geometric mean
• Low-Rank Matrix Completion by Riemannian Optimization
• Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
• A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Iterative Methods for Finding a Trust-region Step
• A Subspace Minimization Method for the Trust-Region Step
• L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family
• Updating Quasi-Newton Matrices with Limited Storage
• The Geometry of Algorithms with Orthogonality Constraints
• The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
• Compact representation of the full Broyden class of quasi‐Newton updates
• A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems
• ROPTLIB
• Computing the matrix geometric mean: Riemannian versus Euclidean conditioning, implementation techniques, and a Riemannian BFGS method
• Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold
• A new, globally convergent Riemannian conjugate gradient method
• Conic Geometric Optimization on the Manifold of Positive Definite Matrices
• Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints
• Benchmarking optimization software with performance profiles.

This page was built for publication: A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy