Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
From MaRDI portal
Publication:2355020
DOI10.1007/s11750-015-0387-7zbMath1342.90146OpenAlexW615245433MaRDI QIDQ2355020
Oliver Stein, Peter Kirst, Paul Steuermann
Publication date: 27 July 2015
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-015-0387-7
Related Items
Scalable branching on dual decomposition of stochastic mixed-integer programming problems, Global optimization of disjunctive programs, A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization, Global optimization of generalized semi-infinite programs using disjunctive programming, Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems, Convergent upper bounds in global minimization with nonlinear equality constraints, A standard branch-and-bound approach for nonlinear semi-infinite problems, Nonconvex constrained optimization by a filtering branch and bound, A general branch-and-bound framework for continuous global multiobjective optimization, A geometric branch and bound method for robust maximization of convex functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- A class of problems where dual bounds beat underestimation bounds
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- An algorithmic framework for convex mixed integer nonlinear programs
- Piecewise-linear approximations of multidimensional functions
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization
- Optimal centered forms
- Test examples for nonlinear programming codes
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- On proving existence of feasible points in equality constrained optimization problems
- PROFIL/BIAS - A fast interval library
- Convex envelopes of monomials of odd degree
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- BARON: A general purpose global optimization software package
- A storm of feasibility pumps for nonconvex MINLP
- On convex relaxations of quadrilinear terms
- Deterministic global optimization. Theory, methods and applications
- Rigorous verification of feasibility
- On rigorous upper bounds to a global optimum
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Simplicial Global Optimization
- Using Piecewise Linear Functions for Solving MINLPs
- The Cutting-Plane Method for Solving Convex Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Critical sets in parametric optimization
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Interval Methods for Systems of Equations
- Variational Analysis
- Dual bounding procedures lead to convergent branch-and-bound algorithms
