Convergence of the constrained gradient method for a class of nonconvex functions

DOI10.1007/BF01097200MaRDI QIDQ918866zbMATH OpenWikidataFDO

Authors Z. R. Gabidullina

Publication date 1990

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/198190

zbMATH Keywords

continuously differentiable pseudoconvex objective functionsconvergence analysisgradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cited in

(6)

• Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition
• Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
• Adaptive conditional gradient method
• NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT
• The Constrained Least Gradient Problem in R n
• A convergence analysis result for constrained convex minimization problem

This page was built for publication: Convergence of the constrained gradient method for a class of nonconvex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918866)