Subgradient method for convex feasibility on Riemannian manifolds

DOI10.1007/S10957-011-9921-4zbMATH Open1270.90101OpenAlexW2029840249WikidataQ115382579 ScholiaQ115382579MaRDI QIDQ415385FDOQ415385

J. G. Melo, G. 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

Riemannian manifoldsnonsmooth analysisfeasibility problemsubgradient algorithmgeneral convexity

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Cites Work

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

Cited In (40)

• Nonlinear evolution equations via resolvent operators on Hadamard manifolds
• Proximal point method for a special class of nonconvex functions on Hadamard manifolds
• Existence results for vector variational inequality problems on Hadamard manifolds
• Title not available (Why is that?)
• A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires
• \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
• On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds
• Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
• Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications
• 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
• A subgradient method for multiobjective optimization on Riemannian manifolds
• First Order Methods for Optimization on Riemannian Manifolds
• Extremum seeking on submanifolds in the Euclidian space
• On maximal monotonicity of bifunctions on Hadamard manifolds
• An incremental subgradient method on Riemannian manifolds
• Limiting subdifferential calculus and perturbed distance function in Riemannian manifolds
• The KKT optimality conditions for optimization problem with interval-valued objective function on Hadamard manifolds
• Karush-Kuhn-Tucker optimality conditions for non-smooth geodesic quasi-convex optimization on Riemannian manifolds
• Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
• Proximal point method for vector optimization on Hadamard manifolds
• Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
• Finite termination of the proximal point method for convex functions on Hadamard manifolds
• Title not available (Why is that?)
• Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds
• Riemannian stochastic fixed point optimization algorithm
• Semivectorial bilevel optimization on Riemannian manifolds
• Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds
• Strong convergence of alternating projections
• Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
• Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
• Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination
• First and second order necessary optimality conditions for multiobjective programming with interval-valued objective functions on Riemannian manifolds
• A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems
• Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds
• Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
• An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
• Second-order optimality conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds
• Path-based incremental target level algorithm on Riemannian manifolds

This page was built for publication: Subgradient method for convex feasibility on Riemannian manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415385)