On the convergence of the Baba and Dorea random optimization methods

DOI10.1007/BF00939542zbMath0683.90071WikidataQ56137800 ScholiaQ56137800MaRDI QIDQ1825142

Maddipati Srinivasa Sarma

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical convergenceglobal minimizationrandom optimization methodstransformer design function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Random gradient-free minimization of convex functions ⋮ Stochastic Three Points Method for Unconstrained Smooth Minimization ⋮ Importance of search-domain reduction in random optimization

Cites Work

• Convergence of a random optimization method for constrained optimization problems
• An algorithm for the solution of constrained generalised polynomial programming problems
• Expected number of steps of a random optimization method