Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
From MaRDI portal
Publication:1668799
DOI10.1007/s10898-018-0632-3zbMath1405.90106OpenAlexW2795632284WikidataQ92909286 ScholiaQ92909286MaRDI QIDQ1668799
N. Kazazakis, Claire S. Adjiman
Publication date: 29 August 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0632-3
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A literature survey of benchmark functions for global optimisation problems
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
- New methods for calculating \(\alpha\)BB-type underestimators
- The cluster problem revisited
- A review of recent advances in global optimization
- Piecewise-linear approximations of multidimensional functions
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- The cluster problem in multivariate global optimization
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Finding all solutions of nonlinearly constrained systems of equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex relaxations of quadrilinear terms
- Deterministic global optimization. Theory, methods and applications
- Affine arithmetic: concepts and applications
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Convex relaxation for solving posynomial programs
- TRUST: A Deterministic Algorithm for Global Optimization
- An Automatic Method of Solving Discrete Programming Problems
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Characterization of convexifiable functions
- McCormick-Based Relaxations of Algorithms
- The Tunneling Algorithm for the Global Minimization of Functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Complete search in continuous global optimization and constraint satisfaction
- An Introduction to Affine Arithmetic
- An Algorithm for the Traveling Salesman Problem
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Performance of convex underestimators in a branch-and-bound framework
