Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
From MaRDI portal
Publication:2205985
DOI10.1007/s10107-019-01418-8zbMath1469.90165arXiv1710.02236OpenAlexW2968757850WikidataQ115385313 ScholiaQ115385313MaRDI QIDQ2205985
Junyu Zhang, Shi-Qian Ma, Shu-Zhong Zhang
Publication date: 21 October 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.02236
ADMMRiemannian manifolditeration complexitynonconvex and nonsmooth optimization\(\epsilon\)-stationary solution
Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Programming in abstract spaces (90C48)
Related Items
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses, A Splitting Scheme for Flip-Free Distortion Energies, An entropy-regularized ADMM for binary quadratic programming, Simple algorithms for optimization on Riemannian manifolds with constraints, Numerical analysis of constrained total variation flows, Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold, ADMM for multiaffine constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- TT-cross approximation for multidimensional arrays
- Fast community detection by SCORE
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- A splitting method for orthogonality constrained problems
- Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Quasi-tangent vectors in flow-invariance and optimization problems on Banach manifolds
- Black box approximation of tensors in hierarchical Tucker format
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Trust-region methods on Riemannian manifolds
- Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method
- Convexified modularity maximization for degree-corrected stochastic block models
- Atomic Decomposition by Basis Pursuit
- Rank-One Approximation to High Order Tensors
- Introduction to Smooth Manifolds
- Projection-like Retractions on Matrix Manifolds
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Robust principal component analysis?
- A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- An Implicit Riemannian Trust-Region Method for the Symmetric Generalized Eigenproblem
- Clarke's tangent cones and the boundaries of closed sets in Rn
- The Geometry of Algorithms with Orthogonality Constraints
- Numerical Optimization
- Optimization Techniques on Riemannian Manifolds
- A Multilinear Singular Value Decomposition
- Proximal Point Algorithm On Riemannian Manifolds
- A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection
- Global rates of convergence for nonconvex optimization on manifolds
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Regularization and Variable Selection Via the Elastic Net
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Low-rank matrix completion using alternating minimization
- The Gradient Projection Method Along Geodesics
- Compressed sensing
- A .699-approximation algorithm for Max-Bisection.
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
