On rigorous upper bounds to a global optimum
From MaRDI portal
Publication:2250091
DOI10.1007/s10898-014-0173-3zbMath1301.90075OpenAlexW2037740752MaRDI QIDQ2250091
Publication date: 4 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0173-3
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Convergent upper bounds in global minimization with nonlinear equality constraints, Some observations on exclusion regions in branch and bound algorithms, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
Uses Software
Cites Work
- On smooth reformulations and direct non-smooth computations for minimax problems
- A reliable affine relaxation method for global optimization
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- On proving existence of feasible points in equality constrained optimization problems
- Rigorous global search: continuous problems
- BARON: A general purpose global optimization software package
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- GlobSol user guide
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- Global Optimization and Constraint Satisfaction
- Nonlinear programming without a penalty function.
