Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
From MaRDI portal
Publication:6593831
DOI10.1007/s10898-024-01378-0MaRDI QIDQ6593831
Publication date: 27 August 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
global convergenceworst-case complexityoptimization on manifoldsRiemannian trust-region methodstensor approximations
Cites Work
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- A splitting method for orthogonality constrained problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Nonmonotone adaptive trust region method
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Complexity bounds for second-order optimality in unconstrained optimization
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A new adaptive trust-region method for system of nonlinear equations
- A new adaptive trust region algorithm for optimization problems
- An adaptive trust region algorithm for large-residual nonsmooth least squares problems
- Tensor eigenvalues and their applications
- An effective adaptive trust region algorithm for nonsmooth minimization
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- An adaptive trust-region method without function evaluations
- Damped Newton's method on Riemannian manifolds
- A brief introduction to manifold optimization
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- A Riemannian symmetric rank-one trust-region method
- Recent advances in trust region algorithms
- Trust-region methods on Riemannian manifolds
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
- Riemannian Optimization for High-Dimensional Tensor Completion
- Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
- Manopt, a Matlab toolbox for optimization on manifolds
- Convergence of Trust-Region Methods Based on Probabilistic Models
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
- Shifted Power Method for Computing Tensor Eigenpairs
- An implicit trust-region method on Riemannian manifolds
- A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
- Introduction to Derivative-Free Optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems
- Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold
- Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models
- Global rates of convergence for nonconvex optimization on manifolds
- Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems
- Accelerating Convergence by Augmented Rayleigh--Ritz Projections For Large-Scale Eigenpair Computation
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
This page was built for publication: Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds