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

MaRDI QIDQ1803120zbMATHFDO

Authors V. N. Nefedov

Publication date 29 June 1993

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

zbMATH Keywords

global optimizationLipschitzian functionsbranch-and-bound\(\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)

Recommendations

• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• scientific article; zbMATH DE number 4062842
• scientific article; zbMATH DE number 757681
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
• A new bounding algorithm for solving Lipschitz optimization problem with box constraints

Cited in

(12)

• Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
• Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron
• A new bounding algorithm for solving Lipschitz optimization problem with box constraints
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• scientific article; zbMATH DE number 4156224 (Why is no real title available?)
• scientific article; zbMATH DE number 4062842 (Why is no real title available?)
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• Lipschitz global optimization methods in control problems
• Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
• IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
• A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

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

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