Minimization of a non-smooth, strongly quasi-convex function by a conditional gradient type method

zbMATH Open0735.90063MaRDI QIDQ3363282FDOQ3363282

Authors: Z. R. Gabidullina 

Publication date: 1989

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

Recommendations

• Constrained gradient method for nonsmooth optimization problems
• scientific article; zbMATH DE number 3910150
• An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
• An Algorithm for Nonsmooth Convex Minimization With Errors
• A variant of the constrained gradient method

zbMATH Keywords

convergence analysisconditional gradient type algorithmnon-smooth, strongly quasi-convex function

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some analogue of quadratic interpolation for a special class of non-smooth functionals and one application to adaptive mirror descent
• On some methods for strongly convex optimization problems with one functional constraint
• Title not available (Why is that?)

This page was built for publication: Minimization of a non-smooth, strongly quasi-convex function by a conditional gradient type method

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