Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
From MaRDI portal
Publication:2330648
DOI10.1007/s10107-018-1285-1zbMath1433.65111OpenAlexW2805907244MaRDI QIDQ2330648
Huikang Liu, Anthony Man-Cho So, Weijie Wu
Publication date: 22 October 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1285-1
linear convergenceŁojasiewicz inequalityline-search methodsquadratic optimization with orthogonality constraintsstochastic variance-reduced gradient method
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization ⋮ Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees ⋮ Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ On generalizing trace minimization principles. II ⋮ Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ Calculus rules of the generalized concave Kurdyka-Łojasiewicz property ⋮ A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints ⋮ A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property ⋮ Unnamed Item ⋮ On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems ⋮ Kurdyka-Łojasiewicz property of zero-norm composite functions ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ The gradient projection method with Armijo's step size on manifolds ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ On generalizing trace minimization principles ⋮ Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem ⋮ Finding the global optimum of a class of quartic minimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Moment inequalities for sums of random matrices and their applications in optimization
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- 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
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error bounds for analytic systems and their applications
- On perturbation bounds for the QR factorization
- Extrema of sums of heterogeneous quadratic forms
- Introductory lectures on convex optimization. A basic course.
- New error bounds and their applications to convergence analysis of iterative algorithms
- From error bounds to the complexity of first-order descent methods for convex functions
- A unified approach to error bounds for structured convex optimization problems
- A geometric analysis of phase retrieval
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence to equilibrium for discretizations of gradient-like flows on Riemannian manifolds
- A generalized solution of the orthogonal Procrustes problem
- Trace optimization and eigenproblems in dimension reduction methods
- Projection-like Retractions on Matrix Manifolds
- A new convergence proof for the higher-order power method and generalizations
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- Guaranteed Matrix Completion via Non-Convex Factorization
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Numerical Methods for Large Eigenvalue Problems
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- On Smooth Decompositions of Matrices
- Optimization Techniques on Riemannian Manifolds
- Perturbation Analyses for the QR Factorization
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- Empirical Arithmetic Averaging Over the Compact Stiefel Manifold
- Phase Retrieval Using Alternating Minimization
- Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization
- Near-Optimal Bounds for Phase Synchronization
- A Riemannian Optimization Approach to the Matrix Singular Value Decomposition
- Stochastic Gradient Descent on Riemannian Manifolds
- Optimization algorithms exploiting unitary constraints
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Provable Sparse Tensor Decomposition
