Pages that link to "Item:Q2564182"
From MaRDI portal
The following pages link to Convergence of the steepest descent method for minimizing quasiconvex functions (Q2564182):
Displaying 33 items.
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces (Q456993) (← links)
- Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
- Continuous gradient projection method in Hilbert spaces (Q597170) (← links)
- On the convergence of a new hybrid projection algorithm (Q882531) (← links)
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case (Q959938) (← links)
- Convergence of a projected gradient method variant for quasiconvex objectives (Q992826) (← links)
- Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← links)
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization (Q1041440) (← links)
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (Q1290597) (← links)
- Descent methods with linesearch in the presence of perturbations (Q1360171) (← links)
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds (Q1762393) (← links)
- Nonsmooth nonconvex global optimization in a Banach space with a basis (Q1767923) (← links)
- A convergence result for discrete steepest descent in weighted Sobolev spaces (Q1809789) (← links)
- Two facts on the convergence of the Cauchy algorithm (Q1841573) (← links)
- A dynamical approach to convex minimization coupling approximation with the steepest descent method (Q1919799) (← links)
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
- The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← links)
- On minimization of upper bound for the convergence rate of the QHSS iteration method (Q2289857) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds (Q2474954) (← links)
- Inexact gradient projection method with relative error tolerance (Q2696906) (← links)
- Algorithms for quasiconvex minimization (Q3112506) (← links)
- A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces (Q3114576) (← links)
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints (Q3629524) (← links)
- The rate of convergence of the method of steepest descent in the constrained minimization problem (Q4101360) (← links)
- On Steepest Descent Algorithms for Discrete Convex Functions (Q4651964) (← links)
- What is quasiconvex analysis? (Q4949175) (← links)
- Convergence of Min-Sum Message Passing for Quadratic Optimization (Q4975868) (← links)
- On steepest descent curves for quasi convex families in Rn (Q4982608) (← links)
- Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis (Q5234284) (← links)
- (Q5337490) (← links)
- (Q5744194) (← links)
- Convergence of steepest descent approximation for set-valued quasi-accretive mapping equations (Q5927946) (← links)