On Convergence of a Random Search Method in Convex Minimization Problems

DOI10.1137/1119084MaRDI QIDQ4077741zbMATH OpenOpenAlexFDO

Authors V. G. Karmanov

Publication date 1974

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1119084

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Search theory (90B40) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited in

(2)

• Stochastic three points method for unconstrained smooth minimization
• Curvature-aware derivative-free optimization

This page was built for publication: On Convergence of a Random Search Method in Convex Minimization Problems

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