Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
type: Item
instance of: scholarly article
title: Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
zbMATH Open document ID: 1405.90106
author: N. Kazazakis
author: Claire S. Adjiman
published in: Journal of Global Optimization
publication date: 2018-08-29T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6928828
zbMATH Keywords: \(\alpha \mathrm{BB}\)
zbMATH Keywords: subenergy
zbMATH Keywords: underestimator
zbMATH Keywords: eigenvalue
describes a project that uses: INTLAB
describes a project that uses: libMC
MaRDI profile type: Publication
Wikidata QID: Q92909286
full work available at URL: s10898-018-0632-3
OpenAlex ID: W2795632284
cites work: A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
cites work: TRUST: A Deterministic Algorithm for Global Optimization
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Convergence rate of McCormick relaxations
cites work: On convex relaxations of quadrilinear terms
cites work: Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
cites work: Q2933736
cites work: Subdivision Direction Selection in Interval Methods for Global Optimization
cites work: Affine arithmetic: concepts and applications
cites work: The cluster problem in multivariate global optimization
cites work: Deterministic global optimization. Theory, methods and applications
cites work: A review of recent advances in global optimization
cites work: Performance of convex underestimators in a branch-and-bound framework
cites work: Q4004279
cites work: A literature survey of benchmark functions for global optimisation problems
cites work: McCormick-Based Relaxations of Algorithms
cites work: Convex envelopes generated from finitely many compact convex sets
cites work: A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: The Tunneling Algorithm for the Global Minimization of Functions
cites work: Reformulations in mathematical programming: automatic symmetry detection and exploitation
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Global optimization. Theory, algorithms, and applications
cites work: Convex relaxation for solving posynomial programs
cites work: Finding all solutions of nonlinearly constrained systems of equations
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Convex envelopes for edge-concave functions
cites work: Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
cites work: Piecewise-linear approximations of multidimensional functions
cites work: Complete search in continuous global optimization and constraint satisfaction
cites work: Q4771768
cites work: Q4949347
cites work: Generalized McCormick relaxations
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: New methods for calculating \(\alpha\)BB-type underestimators
cites work: A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
cites work: An Introduction to Affine Arithmetic
cites work: Explicit convex and concave envelopes through polyhedral subdivisions
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Q3137900
cites work: The cluster problem revisited
cites work: Characterization of convexifiable functions
cites work: Global optimization of general non-convex problems with intermediate bilinear substructures
DOI: 10.1007/S10898-018-0632-3
description: scientific article; zbMATH DE number 6928828