Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
From MaRDI portal
Publication:3789345
DOI10.1080/02331938808843322zbMath0645.90065OpenAlexW1982658920MaRDI QIDQ3789345
No author found.
Publication date: 1988
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938808843322
convergencebranch-and-boundglobal minimumLipschitz continuous functionspartition refinementconstrained global minimizationpartition selectionsequentially generated subintervals
Related Items (20)
The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities ⋮ An intelligent decision support system for assisting industrial wastewater management ⋮ New LP bound in multivariate Lipschitz optimization: Theory and applications ⋮ Formulation assistance for global optimization problems ⋮ On the convergence of adaptive partition algorithms in global optimization ⋮ A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities ⋮ Globally optimized calibration of environmental models ⋮ Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints ⋮ An analytical approach to global optimization ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ An application of Lipschitzian global optimization to product design ⋮ Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves ⋮ Convergent upper bounds in global minimization with nonlinear equality constraints ⋮ Solving nonlinear equation systems via global partition and search: Some experimental results ⋮ The impact of accelerating tools on the interval subdivision algorithm for global optimization ⋮ A decomposition method for MINLPs with Lipschitz continuous nonlinearities ⋮ Stochastic modelling and optimization for environmental management ⋮ Set partition by globally optimized cluster seed points ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
Cites Work
- Unnamed Item
- Unnamed Item
- On the global minimization of concave functions
- Extended univariate algorithms for \(n\)-dimensional global optimization
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- On the convergence of global methods in multiextremal optimization
- Global optimization on convex sets
- A stochastic method for global optimization
- Convergence properties of stochastic optimization procedures
- Globally convergent methods for n-dimensional multiextremal optimization
- Axiomatic approach to statistical models and their use in multimodal optimization theory
- A Sequential Method Seeking the Global Maximum of a Function
This page was built for publication: Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
