Simple algorithms for optimization on Riemannian manifolds with constraints
From MaRDI portal
Publication:2019906
DOI10.1007/s00245-019-09564-3zbMath1468.65072arXiv1901.10000OpenAlexW2963704853WikidataQ115388211 ScholiaQ115388211MaRDI QIDQ2019906
Publication date: 22 April 2021
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.10000
nonsmooth optimizationconstrained optimizationdifferential geometryaugmented Lagrangian methodRiemannian optimizationexact penalty method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Classical differential geometry (53A99)
Related Items
Accelerated optimization on Riemannian manifolds via discrete constrained variational integrators, Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses, Riemannian proximal gradient methods, Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds, Fenchel Duality and a Separation Theorem on Hadamard Manifolds, Continuation Methods for Riemannian Optimization, Riemannian optimization via Frank-Wolfe methods, Completely positive factorization by a Riemannian smoothing method, Fenchel conjugate via Busemann function on Hadamard manifolds, Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space, Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm, Solving graph equipartition SDPs on an algebraic variety, Distance-preserving manifold denoising for data-driven mechanics, Riemannian optimization on unit sphere with \(p\)-norm and its applications, An exact penalty approach for optimization with nonnegative orthogonality constraints, Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization, Slow and finite-time relaxations to \(m\)-bipartite consensus on the Stiefel manifold, Linear Programming on the Stiefel Manifold, An SQP Method for Equality Constrained Optimization on Hilbert Manifolds, Adaptive regularization with cubics on manifolds, Efficient Weingarten map and curvature estimation on manifolds, Emergent behaviors of high-dimensional Kuramoto models on Stiefel manifolds, A Riemannian Newton trust-region method for fitting Gaussian mixture models, Fenchel duality theory and a primal-dual algorithm on Riemannian manifolds, Stitching data: recovering a manifold's geometry from geodesic intersections, Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds, Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds, First- and second-order analysis for optimization problems with manifold-valued constraints, Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- A note on the convergence of barrier algorithms to second-order necessary points
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An example comparing the standard and safeguarded augmented Lagrangian methods
- Smoothing methods for convex inequalities and linear complementarity problems
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- A collection of nonsmooth Riemannian optimization problems
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Robust Low-Rank Matrix Completion by Riemannian Optimization
- Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation
- Manopt, a Matlab toolbox for optimization on manifolds
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- Statistical mechanics of complex networks
- A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
- ROPTLIB
- A second-order sequential optimality condition associated to the convergence of optimization algorithms
- Global rates of convergence for nonconvex optimization on manifolds
- Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds
- On Consistency and Sparsity for Principal Components Analysis in High Dimensions
- Practical Augmented Lagrangian Methods for Constrained Optimization
- On sequential optimality conditions for smooth constrained optimization
- Benchmarking optimization software with performance profiles.
