Subgradient method for convex feasibility on Riemannian manifolds

DOI10.1007/s10957-011-9921-4zbMath1270.90101WikidataQ115382579 ScholiaQ115382579MaRDI QIDQ415385

Jefferson G. Melo, Glaydston C. Bento

Publication date: 8 May 2012

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

Full work available at URL: https://doi.org/10.1007/s10957-011-9921-4

zbMATH Keywords

nonsmooth analysis; Riemannian manifolds; feasibility problem; subgradient algorithm; general convexity

Mathematics Subject Classification ID

90C48: Programming in abstract spaces

Related Items

Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature, Proximal point method for a special class of nonconvex functions on Hadamard manifolds, A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems, The KKT optimality conditions for optimization problem with interval-valued objective function on Hadamard manifolds, Path-based incremental target level algorithm on Riemannian manifolds, Finite termination of the proximal point method for convex functions on Hadamard manifolds, Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination, Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications, \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds, A new approach to the proximal point method: convergence on general Riemannian manifolds, Gap functions and global error bounds for generalized mixed variational inequalities on Hadamard manifolds, Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds, An inexact steepest descent method for multicriteria optimization on Riemannian manifolds, A subgradient method for multiobjective optimization on Riemannian manifolds, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, Semivectorial bilevel optimization on Riemannian manifolds, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, On maximal monotonicity of bifunctions on Hadamard manifolds, An incremental subgradient method on Riemannian manifolds, Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds, Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds, Riemannian stochastic fixed point optimization algorithm, Limiting subdifferential calculus and perturbed distance function in Riemannian manifolds, Existence results for vector variational inequality problems on Hadamard manifolds, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds, Proximal point method for vector optimization on Hadamard manifolds, Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds, Strong convergence of alternating projections, A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires, First Order Methods for Optimization on Riemannian Manifolds, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Monotone and accretive vector fields on Riemannian manifolds
• Convergence of Newton's method for sections on Riemannian manifolds
• Existence of solutions for variational inequalities on Riemannian manifolds
• Proximal subgradient and a characterization of Lipschitz function on Riemannian manifolds
• Newton's method for sections on Riemannian manifolds: Generalized covariant \(\alpha \)-theory
• A unifying local convergence result for Newton's method in Riemannian manifolds
• Local convexity on smooth manifolds
• Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
• Subgradient algorithm on Riemannian manifolds
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Smooth nonlinear optimization of \(\mathbb R^n\)
• Iterative methods of solving stochastic convex feasibility problems and applications
• Variational inequalities on Hadamard manifolds
• A primal dual modified subgradient algorithm with sharp Lagrangian
• Approximation of functions on the Sobolev space on the sphere in the average case setting
• Extended Newton's method for mappings on Riemannian manifolds with values in a cone
• Dini derivative and a characterization for Lipschitz and convex functions on Riemannian manifolds
• Iterative approaches to convex feasibility problems in Banach spaces
• Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
• Incremental Subgradient Methods for Nondifferentiable Optimization
• Kantorovich's theorems for Newton's method for mappings and optimization problems on Lie groups
• Nonsmooth analysis on smooth manifolds
• An implicit trust-region method on Riemannian manifolds
• On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
• Monotone vector fields and the proximal point algorithm on Hadamard manifolds
• On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
• Cyclic subgradient projections
• Proximal Point Algorithm On Riemannian Manifolds
• On Projection Algorithms for Solving Convex Feasibility Problems
• Minimization of unsmooth functionals