A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
type: Item
instance of: scholarly article
title: A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
zbMATH Open document ID: 1256.90038
author: Tapio Westerlund
author: Ruth Misener
author: Anders Skjäl
author: Christodoulos A. Floudas
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-11T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6135547
zbMATH Keywords: global optimization
zbMATH Keywords: \(\alpha \)BB
zbMATH Keywords: convex relaxations
zbMATH Keywords: nonconvex optimization
Wikidata QID: Q62015642
describes a project that uses: ROSE
describes a project that uses: RealPaver
describes a project that uses: libMC
MaRDI profile type: Publication
full work available at URL: s10957-012-0033-6
OpenAlex ID: W1994143266
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Q4331736
cites work: A review of recent advances in global optimization
cites work: Selected papers presented at the conference on the state of the art in global optimization: computational methods and applications, Princeton, NJ, USA, April 28-30, 1995
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems
cites work: A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
cites work: A remark on the GOP algorithm for global optimization
cites work: Finding all solutions of nonlinearly constrained systems of equations
cites work: Reformulations in mathematical programming: automatic symmetry detection and exploitation
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: McCormick-Based Relaxations of Algorithms
cites work: Generalized McCormick relaxations
cites work: Convergence rate of McCormick relaxations
cites work: Construction of convex relaxations using automated code generation techniques
cites work: On the Liu-Floudas convexification of smooth programs
cites work: Characterization of convexifiable functions
cites work: Saddle-point optimality: a look beyond convexity
cites work: On two simple decompositions of Lipschitz functions
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Rigorous convex underestimators for general twice-differentiable problems
cites work: A new global optimization method for univariate constrained twice-differentiable NLP problems
cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints
cites work: An algorithm for bounded-error identification of nonlinear systems based on DC functions
cites work: Deterministic global optimization in nonlinear optimal control problems
cites work: Deterministic global optimization in isothermal reactor network synthesis
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: Filled functions for unconstrained global optimization.
cites work: Ab initio tertiary structure prediction of proteins
cites work: A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
cites work: Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
cites work: Relaxation-Based Bounds for Semi-Infinite Programs
cites work: A rigorous global optimization algorithm for problems with ordinary differential equations
cites work: Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
cites work: On the functional form of convex underestimators for twice continuously differentiable functions
cites work: Q5301184
cites work: Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
cites work: Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
cites work: Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
cites work: Interval Methods for Systems of Equations
cites work: Interval mathematics, algebraic equations and optimization
cites work: Constraint propagation on quadratic constraints
cites work: Algorithm 852
cites work: Q4479208
cites work: On a class of functions attaining their maximum at the vertices of a polyhedron
cites work: Existence and sum decomposition of vertex polyhedral convex envelopes
cites work: Handbook of test problems in local and global optimization
DOI: 10.1007/S10957-012-0033-6
description: scientific article; zbMATH DE number 6135547