A branch-and-reduce approach to global optimization
type: Item
instance of: scholarly article
title: A branch-and-reduce approach to global optimization
zbMATH Open document ID: 0856.90103
DOI: 10.1007/BF00138689
author: Nikolaos V. Sahinidis
author: Hong Seo Ryoo
published in: Journal of Global Optimization
publication date: 1996-10-13T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 934391
zbMATH Keywords: range reduction
zbMATH Keywords: branch-and-bound
zbMATH Keywords: valid inequalities
zbMATH Keywords: range contraction techniques
zbMATH Keywords: global optimization
zbMATH Keywords: branch-and-reduce
zbMATH Keywords: polynomial and multiplicative programs
zbMATH Keywords: engineering design
describes a project that uses: GAMS
describes a project that uses: MINOS
MaRDI profile type: Publication
cites work: A procedure for new product positioning in an attribute space
cites work: Jointly Constrained Biconvex Programming
cites work: Q4274060
cites work: Q5589755
cites work: Role of copositivity in optimality criteria for nonconvex optimization problems
cites work: Q4068464
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Technical Note—Conditions for Global Optimality in Nonlinear Programming
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: A collection of test problems for constrained global optimization algorithms
cites work: On Descent from Local Minima
cites work: Calculation of bounds on variables satisfying nonlinear inequality constraints
cites work: An analytical approach to global optimization
cites work: Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
cites work: Reverse convex programming
cites work: When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?
cites work: Q3997222
cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
cites work: Generalized linear multiplicative and fractional programming
cites work: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
cites work: A parametric successive underestimation method for convex multiplicative programming problems
cites work: An improved branch and bound algorithm for minimum concave cost network flow problems
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Q3677502
cites work: Q3738922
cites work: Q5566070
cites work: Some NP-complete problems in quadratic and nonlinear programming
cites work: An optimality criterion for global quadratic optimization
cites work: Q4040374
cites work: Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
cites work: Handbook of global optimization
cites work: Checking local optimality in constrained quadratic programming is NP- hard
cites work: Optimization methods for computing global minima of nonconvex potential energy functions
cites work: Q3491318
cites work: Q4041062
cites work: Stochastic techniques for global optimization: A survey of recent advances
cites work: A new reformulation-linearization technique for bilinear programming problems
cites work: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
cites work: The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
cites work: Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
cites work: A global optimization approach for solving the convex multiplicative programming problem
cites work: Global optimization
cites work: Convex programs with an additional reverse convex constraint
cites work: Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
cites work: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
cites work: A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
cites work: Q4342463
cites work: Globally minimizing polynomials without evaluating derivatives
cites work: Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés
description: scientific article; zbMATH DE number 934391