Subgradient method for convex feasibility on Riemannian manifolds

From MaRDI portal
Publication:415385

DOI10.1007/s10957-011-9921-4zbMath1270.90101OpenAlexW2029840249WikidataQ115382579 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




Related Items

\(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifoldsIteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifoldsA new approach to the proximal point method: convergence on general Riemannian manifoldsGap functions and global error bounds for generalized mixed variational inequalities on Hadamard manifoldsProximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial casesOn maximal monotonicity of bifunctions on Hadamard manifoldsLinear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian ManifoldsA Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical SystemsEnlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifoldsThe KKT optimality conditions for optimization problem with interval-valued objective function on Hadamard manifoldsRiemannian stochastic fixed point optimization algorithmAn inexact steepest descent method for multicriteria optimization on Riemannian manifoldsA subgradient method for multiobjective optimization on Riemannian manifoldsDynamical systems for solving variational inclusion and fixed point problems on Hadamard manifoldsStrong convergence of alternating projectionsLimiting subdifferential calculus and perturbed distance function in Riemannian manifoldsProximal point method for vector optimization on Hadamard manifoldsA new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desiresSemivectorial bilevel optimization on Riemannian manifoldsOn the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifoldsIteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvatureExistence results for vector variational inequality problems on Hadamard manifoldsFirst Order Methods for Optimization on Riemannian ManifoldsZero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methodsAn incremental subgradient method on Riemannian manifoldsUnconstrained steepest descent method for multicriteria optimization on Riemannian manifoldsSubgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvaturesPath-based incremental target level algorithm on Riemannian manifoldsProximal point method for a special class of nonconvex functions on Hadamard manifoldsFinite termination of the proximal point method for convex functions on Hadamard manifoldsOptimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifoldsProximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite TerminationIncremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications



Cites Work


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