Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
From MaRDI portal
Publication:3176355
DOI10.1137/17M1142478zbMath1415.65139arXiv1708.02016OpenAlexW2884819278WikidataQ115246937 ScholiaQ115246937MaRDI QIDQ3176355
ZaiWen Wen, Jiang Hu, Andre Milzarek, Ya-Xiang Yuan
Publication date: 20 July 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02016
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of successive quadratic programming type (90C55)
Related Items
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints ⋮ An extended delayed weighted gradient algorithm for solving strongly convex optimization problems ⋮ Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ Adaptive trust-region method on Riemannian manifold ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ Effective algorithms for solving trace minimization problem in multivariate statistics ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ An exact penalty approach for optimization with nonnegative orthogonality constraints ⋮ Riemannian Natural Gradient Methods ⋮ AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL ⋮ Ground States of Spin-$F$ Bose--Einstein Condensates ⋮ A brief introduction to manifold optimization ⋮ Orthogonal canonical correlation analysis and applications ⋮ Adaptive regularization with cubics on manifolds ⋮ Newton-based methods for finding the positive ground state of Gross-Pitaevskii equations ⋮ Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints ⋮ Global convergence of Riemannian line search methods with a Zhang-Hager-type condition ⋮ On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint ⋮ Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold ⋮ Finding the global optimum of a class of quartic minimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Low-rank tensor completion by Riemannian optimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
- Minimizing a differentiable function over a differential manifold
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- A Riemannian symmetric rank-one trust-region method
- Algebraic rules for quadratic regularization of Newton's method
- Trust-region methods on Riemannian manifolds
- Adaptive Regularized Self-Consistent Field Iteration with Exact Hessian for Electronic Structure Calculation
- Low-Rank Matrix Completion by Riemannian Optimization
- Gradient Type Optimization Methods For Electronic Structure Calculations
- Projection-like Retractions on Matrix Manifolds
- Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
- Manopt, a Matlab toolbox for optimization on manifolds
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations
- A Riemannian BFGS Method for Nonconvex Optimization Problems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The Geometry of Algorithms with Orthogonality Constraints
- Optimization Techniques on Riemannian Manifolds
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
- Accelerated Methods for NonConvex Optimization
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Finding approximate local minima faster than gradient descent
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
- An Extrinsic Look at the Riemannian Hessian
- A Proximal Gradient Method for Ensemble Density Functional Theory
