Convergence of the steepest descent method for minimizing quasiconvex functions
From MaRDI portal
Publication:2564182
DOI10.1007/BF02192649zbMath0866.90094OpenAlexW2044047732MaRDI QIDQ2564182
Publication date: 7 January 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02192649
We Found 22 Related Items (max. 100)
Descent methods with linesearch in the presence of perturbations ⋮ Continuous gradient projection method in Hilbert spaces ⋮ On the convergence of a new hybrid projection algorithm ⋮ Global convergence of a modified gradient projection method for convex constrained problems ⋮ Inexact gradient projection method with relative error tolerance ⋮ A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces ⋮ Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds ⋮ The gradient and heavy ball with friction dynamical systems: The quasiconvex case ⋮ The self regulation problem as an inexact steepest descent method for multicriteria optimization ⋮ Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ Nonsmooth nonconvex global optimization in a Banach space with a basis ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ Convergence of a projected gradient method variant for quasiconvex objectives ⋮ What is quasiconvex analysis? ⋮ Hybrid conjugate gradient algorithm for unconstrained optimization ⋮ Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis ⋮ Algorithms for quasiconvex minimization ⋮ Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization ⋮ On the projected subgradient method for nonsmooth convex optimization in a Hilbert space ⋮ A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces ⋮ Two facts on the convergence of the Cauchy algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A direct method of linearization for continuous minimax problems
- Minimization of functions having Lipschitz continuous first partial derivatives
- An aggregate subgradient method for nonsmooth convex minimization
- A linearization method for minimizing certain quasidifferentiable functions
- Full convergence of the steepest descent method with inexact line searches
This page was built for publication: Convergence of the steepest descent method for minimizing quasiconvex functions
