A brief introduction to manifold optimization
From MaRDI portal
Publication:2218094
DOI10.1007/s40305-020-00295-9zbMath1474.49093arXiv1906.05450OpenAlexW3014571813MaRDI QIDQ2218094
Jiang Hu, Xin Liu, ZaiWen Wen, Ya-Xiang Yuan
Publication date: 12 January 2021
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.05450
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27) Manifolds and measure-geometric topics (49Q99)
Related Items (37)
Extragradient method and golden ratio method for equilibrium problems on Hadamard manifolds ⋮ Energy-adaptive Riemannian optimization on the Stiefel manifold ⋮ Constraint optimization and SU(N) quantum control landscapes ⋮ Geometric Inexact Newton Method for Generalized Singular Values of Grassmann Matrix Pair ⋮ Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds ⋮ Implicit steepest descent algorithm for optimization with orthogonality constraints ⋮ An accelerated first-order method for non-convex optimization on manifolds ⋮ Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space ⋮ An Improved Unconstrained Approach for Bilevel Optimization ⋮ Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ Adaptive trust-region method on Riemannian manifold ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ Solving graph equipartition SDPs on an algebraic variety ⋮ Proximal gradient algorithm with trust region scheme on Riemannian manifold ⋮ Tutorial on Amortized Optimization ⋮ Optimization on Manifolds via Graph Gaussian Processes ⋮ A collection of efficient retractions for the symplectic Stiefel manifold ⋮ A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ Optimality conditions for Tucker low-rank tensor optimization ⋮ Weighted Trace-Penalty Minimization for Full Configuration Interaction ⋮ Riemannian Natural Gradient Methods ⋮ A hybrid Riemannian conjugate gradient method for nonconvex optimization problems ⋮ Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds ⋮ Riemannian conjugate gradient methods with inverse retraction ⋮ Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils ⋮ Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization ⋮ A Riemannian rank-adaptive method for low-rank matrix completion ⋮ Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds ⋮ Riemannian Optimization on the Symplectic Stiefel Manifold ⋮ Global convergence of Riemannian line search methods with a Zhang-Hager-type condition ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ Spline estimation of functional principal components via manifold conjugate gradient algorithm ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Low-rank tensor completion by Riemannian optimization
- A splitting method for orthogonality constrained problems
- Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization
- Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- Intrinsic representation of tangent vectors and vector transports on matrix manifolds
- Near-optimal stochastic approximation for online principal component estimation
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A majorization algorithm for constrained correlation matrix approximation
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
- Minimizing a differentiable function over a differential manifold
- Problems of distance geometry and convex properties of quadratic maps
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Fast rank-one alternating minimization algorithm for phase retrieval
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- A Riemannian symmetric rank-one trust-region method
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Localized density matrix minimization and linear-scaling algorithms
- Trust-region methods on Riemannian manifolds
- Trace-penalty minimization for large-scale eigenspace computation
- Local minima and convergence in low-rank semidefinite programming
- Optimization theory and methods. Nonlinear programming
- Phase recovery, MaxCut and complex semidefinite programming
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- Robust Low-Rank Matrix Completion by Riemannian Optimization
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices
- Adaptive Regularized Self-Consistent Field Iteration with Exact Hessian for Electronic Structure Calculation
- Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions
- 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
- On the Convergence of the Self-Consistent Field Iteration in Kohn--Sham Density Functional Theory
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
- The Geometry of Algorithms with Orthogonality Constraints
- Robust Rayleigh Quotient Minimization and Nonlinear Eigenvalue Problems
- A Conjugate Gradient Method for Electronic Structure Calculations
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems
- Non-convex clustering via proximal alternating linearized minimization method
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
- A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- Global rates of convergence for nonconvex optimization on manifolds
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- Quotient Geometry with Simple Geodesics for the Manifold of Fixed-Rank Positive-Semidefinite Matrices
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
- A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems
- Accelerating Convergence by Augmented Rayleigh--Ritz Projections For Large-Scale Eigenpair Computation
- Stochastic Gradient Descent on Riemannian Manifolds
- Local Improvement Results for Anderson Acceleration with Inaccurate Function Evaluations
- Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping
- On the Analysis of the Discretized Kohn--Sham Density Functional Theory
- A Proximal Gradient Method for Ensemble Density Functional Theory
- An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
This page was built for publication: A brief introduction to manifold optimization
