Some problems of solving Lipschitzian global optimization problems using the branch and bound method
From MaRDI portal
Publication:1803120
zbMATH Open0776.90060MaRDI QIDQ1803120FDOQ1803120
Authors: V. N. Nefedov
Publication date: 29 June 1993
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
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
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (11)
- IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Lipschitz global optimization methods in control problems
- Title not available (Why is that?)
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- A new bounding algorithm for solving Lipschitz optimization problem with box constraints
- Title not available (Why is that?)
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)