\(\alpha BB\): A global optimization method for general constrained nonconvex problems
type: Item
instance of: scholarly article
title: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
zbMATH Open document ID: 0846.90087
DOI: 10.1007/BF01099647
author: Costas D. Maranas
author: Ioannis P. Androulakis
author: Christodoulos A. Floudas
published in: Journal of Global Optimization
publication date: 1996-10-03T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 881222
zbMATH Keywords: constrained optimization
zbMATH Keywords: convex relaxation
zbMATH Keywords: branch-and-bound global optimization
zbMATH Keywords: finite \(\varepsilon\)-convergence
zbMATH Keywords: successive subdivision of the original region
zbMATH Keywords: series of nonlinear convex minimization
MaRDI profile type: Publication
cites work: Jointly constrained bilinear programs and related problems: An overview
cites work: Jointly Constrained Biconvex Programming
cites work: Global minimization by reducing the duality gap
cites work: Primal-relaxed dual global optimization approach
cites work: Q4004279
cites work: Q4692508
cites work: Global optimization of univariate Lipschitz functions. I: Survey and properties
cites work: Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
cites work: A new simplicial cover technique in constrained global optimization
cites work: On the convergence of global methods in multiextremal optimization
cites work: Q3997222
cites work: Global minimum potential energy conformations of small molecules
cites work: Q4311915
cites work: Finding all solutions of nonlinearly constrained systems of equations
cites work: Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
cites work: Q4040272
cites work: Stochastic global optimization methods part I: Clustering methods
cites work: Optimization by Simulated Annealing
cites work: A new reformulation-linearization technique for bilinear programming problems
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: Dual quadratic estimates in polynomial and Boolean programming
cites work: Global minimization of a difference of two convex functions
cites work: A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
full work available at URL: https://doi.org/10.1007/bf01099647
OpenAlex ID: W2056371558
description: scientific article; zbMATH DE number 881222