The method of gradient descent for minimizing non-convex functions

zbMath0817.49028MaRDI QIDQ1842340

Alexey F. Izmailov, Alexey A. Tret'yakov

Publication date: 15 May 1995

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

rate of convergencestrong convergenceunconditional minimizationmethod of gradient descent

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52)

Related Items (10)

Application of \(p\)-regularity theory to the Duffing equation ⋮ High order stability conditions for degenerate optimization problems; elements of \(p\)-regularity theory ⋮ On the equivalence of singular and ill-posed problems: the \(p\)-factor regularization method ⋮ \(p\)-regularity theory and the existence of a solution to a boundary value problem continuously dependent on boundary conditions ⋮ On solution existence for a singular nonlinear Burgers equation with small parameter and \(p\)-regularity theory ⋮ \(p\)-factor methods for nonregular inequality-constrained optimization problems ⋮ Application of \(p\)-regularity theory to nonlinear boundary value problems ⋮ Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints ⋮ The \(p\)th-order optimality conditions for inequality constrained optimization problems ⋮ Existence of real solutions of nonlinear equations without a priori normality assumptions

This page was built for publication: The method of gradient descent for minimizing non-convex functions