A new approach to the proximal point method: convergence on general Riemannian manifolds

DOI10.1007/s10957-015-0861-2zbMath1338.49067OpenAlexW2239703712WikidataQ115382564 ScholiaQ115382564MaRDI QIDQ283913

de Carvalho Glaydston Bento, João Xavier da Cruz Neto, Paulo Roberto Oliveira

Publication date: 17 May 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0861-2

zbMATH Keywords

Riemannian manifoldsnon-convex optimizationproximal point methodKurdyka-Lojasiewicz inequality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52) Calculus on manifolds; nonlinear operators (58C99)

Related Items

Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space ⋮ Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds ⋮ Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ General descent method using w-distance. Application to emergence of habits following worthwhile moves ⋮ An extragradient-type algorithm for variational inequality on Hadamard manifolds ⋮ A brief introduction to manifold optimization ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Unnamed Item ⋮ Dual descent methods as tension reduction systems ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ Convergence Results for Proximal Point Algorithm in Complete Cat(0) Space for Multivalued Mappings ⋮ An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising ⋮ Nonlinear matrix recovery using optimization on the Grassmann manifold ⋮ An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A subgradient method for multiobjective optimization on Riemannian manifolds
• Subgradient method for convex feasibility on Riemannian manifolds
• Singularities of monotone vector fields and an extragradient-type algorithm
• Monotone and accretive vector fields on Riemannian manifolds
• Resolvents of set-valued monotone vector fields in Hadamard manifolds
• Proximal methods in reflexive Banach spaces without monotonicity
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
• On gradients of functions definable in o-minimal structures
• Proximal point methods and nonconvex optimization
• Geodesic monotone vector fields
• Geometric categories and o-minimal structures
• Korpelevich's method for variational inequality problems on Hadamard manifolds
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Monotonicity of the complementary vector field of a nonexpansive map
• Sectional curvatures in nonlinear optimization
• Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
• A proximal algorithm with quasi distance. Application to habit's formation
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Nonsmooth analysis on smooth manifolds
• Clarke Subgradients of Stratifiable Functions
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Monotone vector fields and the proximal point algorithm on Hadamard manifolds
• Locally Geodesically Quasiconvex Functions on Complete Riemannian Manifolds
• A generalized proximal point algorithm for certain non-convex minimization problems
• Submonotone mappings and the proximal point algorithm
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Proximal Point Algorithm On Riemannian Manifolds
• Proximal Methods for Cohypomonotone Operators
• A projection-type method for variational inequalities on Hadamard manifolds and verification of solution existence
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Pointwise convergence of gradient‐like systems
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Proof of the gradient conjecture of R. Thom.

This page was built for publication: A new approach to the proximal point method: convergence on general Riemannian manifolds