BARON: A general purpose global optimization software package
Journal of Global OptimizationPublished 1 March 1996
Nikolaos V. Sahinidis
Citations803
SJR quartileQ1
SJR score0.81
SNIP1.46
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The Branch-And-Reduce Optimization Navigator (BARON) is a computational system for facilitating the solution of nonconvex optimization problems to global optimality.
Abstract
The Branch-And-Reduce Optimization Navigator (BARON) is a computational system for facilitating the solution of nonconvex optimization problems to global optimality. We provide a brief description of the algorithms used by the software, describe the types of problems that can be currently solved and summarize our recent computational experience. BARON is available by anonymous ftp from aristotle. me. uiuc. edu.
Keywords
Computer ScienceMathematicsEngineering
Computers & Chemical EngineeringGlobal optimization of nonconvex NLPs and MINLPs with applications in process design
435 Citations1995Hanil Ryoo, Nikolaos V. Sahinidis
Computational results demonstrate that the algorithm compares very favorably to several other current approaches when applied to a large collection of global optimization and process design problems, typically faster, requires less storage and it produces more accurate results.
Journal of Global OptimizationA branch-and-reduce approach to global optimization
340 Citations1996Hong S. Ryoo, Nikolaos V. Sahinidis
Valid inequalities and range contraction techniques that can be used to reduce the size of the search space of global optimization problems are presented and incorporated within the branch-and-bound framework to result in a branch- and-reduce global optimization algorithm.
Nonconvex optimization and its applicationsGlobal Optimization in Engineering Design
198 Citations1996Ignacio E. Grossmann
A Pipe Reliability and Cost Model for an Integrated Approach Toward Designing Water Distribution Systems H.D. Sherali, et al, and Alternative Bounding Approximations for the Global Optimization of Various Engineering Design Problems I.E. Swaney.
Journal of Global OptimizationA Finite Algorithm for Global Minimization of Separable Concave Programs
97 Citations1998J. Parker Shectman, Nikolaos V. Sahinidis
A new algorithm is proposed that finds the exact global minimum of this problem in a finite number of iterations and extends a guarantee of finiteness to all branch-and-bound algorithms for concave programming that (1) partition exhaustively using rectangular subdivisions and (2) branch on the incumbent solution when possible.
Engineering OptimizationGLOBAL OPTIMIZATION ALGORITHMS FOR CHIP LAYOUT AND COMPACTION
78 Citations1995Michael C. Dorneich, Nikolaos V. Sahinidis
A new mixed-integer nonlinear programming formulation for simultaneous chip layout and two-dimensional compaction is presented and global optimization algorithms are developed for this model as well as for an existing formulation for the chip compaction problem.
Nonconvex optimization and its applicationsPlanning of Chemical Process Networks via Global Concave Minimization
19 Citations1996Ming-Long Liu, Nikolaos V. Sahinidis +1 more
This paper proposes a branch-and-bound global optimization algorithm that exploits the concavity and separability of the objective function and the linearity of the constraint set and terminates with the exact global optimum in a finite number of iterations.
International Journal of Production ResearchA branch-and-bound approach for machine selection in just-in-time manufacturing systems
11 Citations1996Raúl Gutiérrez, Nikolaos V. Sahinidis