An inexact Riemannian proximal gradient method (Q2701414)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	An inexact Riemannian proximal gradient method	scientific article

Statements

scholarly article

0 references

An inexact Riemannian proximal gradient method (English)

0 references

0 references

Computational Optimization and Applications

0 references

publication date

28 April 2023

0 references

full work available at URL

https://arxiv.org/abs/2111.07269

0 references

zbMATH Keywords

Riemannian optimization

0 references

Riemannian proximal gradient

0 references

sparse PCA

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

First-Order Methods in Optimization

0 references

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Accelerated gradient methods for nonconvex nonlinear and stochastic programming

0 references

Compressed modes for variational problems in mathematics and physics

0 references

An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis

0 references

Sparse Variable PCA Using Geodesic Steepest Descent

0 references

Sparse PCA: optimal rates and adaptive estimation

0 references

Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold

0 references

0 references

Solving monotone inclusions via compositions of nonexpansive averaged operators

0 references

Total Variation Projection With First Order Schemes

0 references

Accelerated and Inexact Forward-Backward Algorithms

0 references

Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope

0 references

0 references

0 references

Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds

0 references

Introduction to Riemannian Manifolds

0 references

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Global rates of convergence for nonconvex optimization on manifolds

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Proof of the gradient conjecture of R. Thom.

0 references

A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

A regularized semi-smooth Newton method with projection steps for composite convex programs

0 references

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

A unified approach to error bounds for structured convex optimization problems

0 references

A Broyden Class of Quasi-Newton Methods for Riemannian Optimization

0 references

A Riemannian symmetric rank-one trust-region method

0 references

0 references

Intrinsic representation of tangent vectors and vector transports on matrix manifolds

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10589-023-00451-W

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2701414

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2701414&oldid=39208115"