A Riemannian Proximal Newton Method
From MaRDI portal
Publication:6202763
DOI10.1137/23m1565097arXiv2304.04032WikidataQ128162580 ScholiaQ128162580MaRDI QIDQ6202763
Unnamed Author, Wen Huang, Pierre-Antoine Absil, Rujun Jiang, Simon Vary
Publication date: 27 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.04032
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mathematical programming (90Cxx) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- Intrinsic representation of tangent vectors and vector transports on matrix manifolds
- A proximal Newton-type method for equilibrium problems
- Lectures on convex optimization
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- Riemannian proximal gradient methods
- A nonsmooth version of Newton's method
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- An inexact Riemannian proximal gradient method
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- Accelerated and Inexact Forward-Backward Algorithms
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
- Implicit Functions and Solution Mappings
- Introduction to Riemannian Manifolds
- On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
- First-Order Methods in Optimization
- Large-scale Sparse Inverse Covariance Matrix Estimation
- Convex Sparse Spectral Clustering: Single-View to Multi-View
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods
- An Introduction to Optimization on Smooth Manifolds
- An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis
- Global rates of convergence for nonconvex optimization on manifolds
- Compressed modes for variational problems in mathematics and physics
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- An Extrinsic Look at the Riemannian Hessian
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
- A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
- A further result on an implicit function theorem for locally Lipschitz functions
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
