On Convergence of a Random Search Method in Convex Minimization Problems

DOI10.1137/1119084zbMath0316.90056OpenAlexW1999128222MaRDI QIDQ4077741

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) Convex programming (90C25) Search theory (90B40) Methods of successive quadratic programming type (90C55)

Related Items (1)

Stochastic Three Points Method for Unconstrained Smooth Minimization

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