Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
From MaRDI portal
Publication:2474954
DOI10.1016/j.jmaa.2007.10.010zbMath1144.90030OpenAlexW2077321023WikidataQ115346218 ScholiaQ115346218MaRDI QIDQ2474954
E. M. Quispe, E. A. Papa Quiroz, Paulo Roberto Oliveira
Publication date: 6 March 2008
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.10.010
Related Items (24)
\(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds ⋮ Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds ⋮ Approximation Methods for Nonexpansive Type Mappings in Hadamard Manifolds ⋮ A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems ⋮ An inexact steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ A subgradient method for multiobjective optimization on Riemannian manifolds ⋮ Korpelevich's method for variational inequality problems on Hadamard manifolds ⋮ Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds ⋮ A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization ⋮ Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints ⋮ Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds ⋮ The proximal point algorithm for pseudomonotone variational inequalities on Hadamard manifolds ⋮ Unnamed Item ⋮ An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass ⋮ Modified Tseng's extragradient methods for variational inequality on Hadamard manifolds ⋮ Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ \(H_2\) optimal model order reduction of the discrete system on the product manifold ⋮ Proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ A projection-type method for variational inequalities on Hadamard manifolds and verification of solution existence ⋮ A projection algorithm for set-valued variational inequalities on Hadamard manifolds ⋮ Long time behavior of quasi-convex and pseudo-convex gradient systems on Riemannian manifolds
Cites Work
- Calculus of variations in \(L^ \infty\)
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- Subgradient algorithm on Riemannian manifolds
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Quasiconvex optimization and location theory
- A steepest descent method for vector optimization
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- New self-concordant barrier for the hypercube
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- Convergence of the steepest descent method for minimizing quasiconvex functions
- Lectures on Modern Convex Optimization
- Optimization Techniques on Riemannian Manifolds
- Proximal Point Algorithm On Riemannian Manifolds
- Full convergence of the steepest descent method with inexact line searches
- A proximal regularization of the steepest descent method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
