An active method of searching for the global minimum of a concave function

DOI10.1016/0041-5553(84)90124-1zbMath0559.90068OpenAlexW2031277824MaRDI QIDQ5184677

N. S. Vasil'ev

Publication date: 1984

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(84)90124-1

zbMATH Keywords

convex polytopeglobal minimizationepsilon solutionsmooth concave objective functionstrongly convex feasible domain

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)

Related Items (1)

Active constraints, indefinite quadratic test problems, and complexity

This page was built for publication: An active method of searching for the global minimum of a concave function