Subgradient algorithm on Riemannian manifolds
From MaRDI portal
Publication:1264990
DOI10.1023/A:1022675100677zbMath0907.90244OpenAlexW1550635507WikidataQ115335141 ScholiaQ115335141MaRDI QIDQ1264990
Paulo Roberto Oliveira, Orizon P. Ferreira
Publication date: 3 December 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022675100677
Related Items
\(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds ⋮ Convexity and some geometric properties ⋮ Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds ⋮ Gap functions and global error bounds for generalized mixed variational inequalities on Hadamard manifolds ⋮ Concepts and techniques of optimization on the sphere ⋮ Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases ⋮ Approximation Methods for Nonexpansive Type Mappings in Hadamard Manifolds ⋮ On maximal monotonicity of bifunctions on Hadamard manifolds ⋮ A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds ⋮ A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems ⋮ Proximal Point Algorithm On Riemannian Manifolds ⋮ Fenchel Duality and a Separation Theorem on Hadamard Manifolds ⋮ \(L^\alpha \) Riemannian weighted centers of mass applied to compose an image filter to diffusion tensor imaging ⋮ A subgradient method for multiobjective optimization on Riemannian manifolds ⋮ Korpelevich's method for variational inequality problems on Hadamard manifolds ⋮ Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ A proximal point algorithm for DC functions on Hadamard manifolds ⋮ A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ Subgradient method for convex feasibility on Riemannian manifolds ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ Subgradient algorithm for computing contraction metrics for equilibria ⋮ A class of primal affine scaling algorithms ⋮ The proximal point algorithm for pseudomonotone variational inequalities on Hadamard manifolds ⋮ Review on contraction analysis and computation of contraction metrics ⋮ An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds ⋮ Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature ⋮ Unnamed Item ⋮ Non-smooth Variational Regularization for Processing Manifold-Valued Data ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Subgradient algorithms on Riemannian manifolds of lower bounded curvatures ⋮ An incremental subgradient method on Riemannian manifolds ⋮ Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds ⋮ New self-concordant barrier for the hypercube ⋮ Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ A two-phase-like proximal point algorithm in domains of positivity ⋮ Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures ⋮ Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ Singularities of monotone vector fields and an extragradient-type algorithm ⋮ A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images ⋮ A Graph Framework for Manifold-Valued Data ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ Fenchel duality theory and a primal-dual algorithm on Riemannian manifolds ⋮ A projection-type method for variational inequalities on Hadamard manifolds and verification of solution existence ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising ⋮ A Subgradient Algorithm for Data-Rate Optimization in the Remote State Estimation Problem ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Geodesic convexity in nonlinear optimization
- Minimizing a differentiable function over a differential manifold
- Convex functions on complete noncompact manifolds: Topological structure
- Convergence of some algorithms for convex minimization
- A class of polynomial variable metric algorithms for linear optimization
- Nonlinear coordinate representations of smooth optimization problems
- Optimization and dynamical systems
- An aggregate subgradient method for nonsmooth convex minimization
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- Full convergence of the steepest descent method with inexact line searches
