scientific article; zbMATH DE number 4141808

MaRDI QIDQ3474487zbMATH OpenFDO

Authors Z. R. Gabidullina

Publication date 1987

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

zbMATH Keywords

convergence analysisgradient methodcontinuously differentiable pseudoconvex objective functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• Convergence of the gradient projection method for generalized convex minimization
• scientific article; zbMATH DE number 3936943
• Minimization of a non-smooth, strongly quasi-convex function by a conditional gradient type method
• An extension of the conditional gradient method to a class of nonconvex optimization problems
• On the gradient method in a Hilbert space in the case of nonisolated minima

Cited in

(9)

• On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
• Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition
• An extension of the conditional gradient method to a class of nonconvex optimization problems
• Asymptotic behavior of solutions to a second-order gradient equation of pseudo-convex type
• Relaxation methods with step regulation for solving constrained optimization problems
• On \(\varepsilon\)-quasigradient approximation of pseudogradient mappings of regular functions
• A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
• Linearly convergent away-step conditional gradient for non-strongly convex functions

This page was built for publication:

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