The rate of convergence of the method of steepest descent in the constrained minimization problem
From MaRDI portal
(Redirected from Publication:4101360)
Recommendations
- scientific article; zbMATH DE number 3492092
- The rate of convergence of the method of steepest descent in a Euclidean norm
- Convergence of the steepest descent method for minimizing quasiconvex functions
- scientific article; zbMATH DE number 4074336
- A convergence rate result for a steepest descent method and a minimal error method for the solution of nonlinear ill-posed problems
- The convergence of the steepest descent algorithm for D.C.optimization
- A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions
- The rate of convergence of conjugate gradients
- ESTIMATES OF THE RATE OF CONVERGENCE FOR CERTAIN MINIMIZATION ALGORITHMS FOR STRONGLY CONVEX FUNCTIONS
- scientific article; zbMATH DE number 3147900
Cited in
(7)- scientific article; zbMATH DE number 4092680 (Why is no real title available?)
- Constrained steepest descent in the 2-Wasserstein metric
- On the rate of convergence of the minimization method along vectors in a given directional system
- ACCELERATION DE LA CONVERGENCE DE LA MÉTHODE DE LA PLUS FORTE PENTE
- Steepest descent methods with generalized distances for constrained optimization
- Level set of the asymptotic rate of convergence for the method of steepest descent
- Convergence of the steepest descent method for minimizing quasiconvex functions
This page was built for publication: The rate of convergence of the method of steepest descent in the constrained minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101360)
