On rigorous upper bounds to a global optimum
From MaRDI portal
Publication:2250091
Recommendations
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Constraint aggregation for rigorous global optimization
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- New results on verified global optimization
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
Cites work
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- A reliable affine relaxation method for global optimization
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- BARON: A general purpose global optimization software package
- Benchmarking global optimization and constraint satisfaction codes
- GlobSol user guide
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Nonlinear programming without a penalty function.
- On proving existence of feasible points in equality constrained optimization problems
- On smooth reformulations and direct non-smooth computations for minimax problems
- Rigorous global search: continuous problems
Cited in
(14)- On consistency of bounding operations in deterministic global optimization
- On proving existence of feasible points in equality constrained optimization problems
- Numerical solution for bounding feasible point sets
- 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
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Optimal Search for the Global Maximum of Functions with Bounded Seminorm
- On the Optimality and Limitations of Buehler Bounds
- Mathematically rigorous global optimization in floating-point arithmetic
- Upper bounding in inner regions for global optimization under inequality constraints
- Symbolic-interval heuristic for bound-constrained minimization
- On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination
This page was built for publication: On rigorous upper bounds to a global optimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250091)
