Some problems of solving Lipschitzian global optimization problems using the branch and bound method

zbMath0776.90060MaRDI QIDQ1803120

V. N. Nefedov

Publication date: 29 June 1993

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

zbMATH Keywords

global optimizationbranch-and-boundLipschitzian functions\(\varepsilon\)-optimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron ⋮ Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints

This page was built for publication: Some problems of solving Lipschitzian global optimization problems using the branch and bound method