-
Chapter
GAMS/BARON: A Tutorial and Empirical Performance Analysis
The purpose of this chapter is threefold. First, to provide modelers, students, and practitioners with easily accessible models and reproducible computational results. Second, to demonstrate that the algorithm...
-
Chapter
Convex Extensions and Relaxation Strategies
Central to the efficiency of global optimization methods for nonconvex mathematical programs is the capability to construct tight convex relaxations. In this chapter, we develop the theory of convex extensions...
-
Chapter
Exact Algorithms for Global Optimization of Mixed-Integer Nonlinear Programs
This chapter presents recent advances in the development and application of global optimization algorithms for solving mixed-integer nonlinear programs (MINLPs). It is demonstrated that practically relevant no...
-
Article
Prologue
-
Article
Product Disaggregation in Global Optimization and Relaxations of Rational Programs
We consider the product of a single continuous variable and the sum of a number of continuous variables. We show that “product disaggregation” (distributing the product over the sum) leads to tighter linear pr...
-
Article
Convex extensions and envelopes of lower semi-continuous functions
We define a convex extension of a lower semi-continuous function to be a convex function that is identical to the given function over a pre-specified subset of its domain. Convex extensions are not necessaril...
-
Article
Global Optimization of 0-1 Hyperbolic Programs
We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch and boun...
-
Chapter and Conference Paper
Global Optimization and Constraint Satisfaction: The Branch-and-Reduce Approach
In the early 1990s, we proposed the integration of constraint programming and optimization techniques within the branch-and-bound framework for the global optimization of nonconvex nonlinear and mixed-integer ...
-
Article
Prologue
-
Article
Global Optimization of Multiplicative Programs
This paper develops global optimization algorithms for linear multiplicative and generalized linear multiplicative programs based upon the lower bounding procedure of Ryoo and Sahinidis [30] and new greedy bra...
-
Article
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
This work addresses the development of an efficient solution strategy for obtaining global optima of continuous, integer, and mixed-integer nonlinear programs. Towards this end, we develop novel relaxation sch...
-
Article
A finite branch-and-bound algorithm for two-stage stochastic integer programs
This paper addresses a general class of two-stage stochastic programs with integer recourse and discrete distributions. We exploit the structure of the value function of the second-stage integer problem to dev...
-
Article
Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints
In the tradition of modeling languages for optimization, a single model is passed to a solver for solution. In this paper, we extend BARON’s modeling language in order to facilitate the communication of proble...
-
Article
A polyhedral branch-and-cut approach to global optimization
A variety of nonlinear, including semidefinite, relaxations have been developed in recent years for nonconvex optimization problems. Their potential can be realized only if they can be solved with sufficient s...
-
Chapter and Conference Paper
A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem
A fundamental problem in molecular biology is the comparison of 3-dimensional protein folds in order to develop similarity measures and exploit them for protein clustering, database searches, and drug design. ...
-
Article
Global optimization in stabilizing controller design
In this paper, we develop a global optimization methodology to solve stabilization problems. We first formulate stabilization problems as bilevel programming problems. By invoking the Hurwitz stability conditi...
-
Reference Work Entry In depth
Chemical Process Planning
Keywords
-
Reference Work Entry In depth
Optimization Techniques for Phase Retrieval Based on Single-Crystal X-Ray Diffraction Data
Introduction
-
Reference Work Entry In depth
Contact Map Overlap Maximization Problem, CMO
Introduction
-
Reference Work Entry In depth
Time-Dependent Traveling Salesman Problem
Keywords