An inexact variable metric proximal linearization method for composite optimization on manifolds
From MaRDI portal
Cites work
- 10.1162/153244303321897735
- A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A feasible method for optimization with orthogonality constraints
- A manifold inexact augmented Lagrangian method for nonsmooth optimization on Riemannian submanifolds in Euclidean space
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
- A Riemannian alternating direction method of multipliers
- A Riemannian Proximal Newton Method
- A Riemannian smoothing steepest descent method for non-Lipschitz optimization on embedded submanifolds of \(\mathbb{R}^n\)
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
- An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold
- An augmented Lagrangian approach for sparse principal component analysis
- An inexact Riemannian proximal gradient method
- An Introduction to Optimization on Smooth Manifolds
- An Invitation to Tame Optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Sparse Spectral Clustering: Single-View to Multi-View
- Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Geometry of the symplectic Stiefel manifold endowed with the Euclidean metric
- Global rates of convergence for nonconvex optimization on manifolds
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Line search algorithms for locally Lipschitz functions on Riemannian manifolds
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Optimization and nonsmooth analysis
- Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Riemannian proximal gradient methods
- Smooth minimization of non-smooth functions
- Symplectic model reduction of Hamiltonian systems
- Tame functions are semismooth
- Two-Point Step Size Gradient Methods
- Variational Analysis
This page was built for publication: An inexact variable metric proximal linearization method for composite optimization on manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346801)
