19 Result(s)
within
Chapter
Nikolaos V. Sahinidis
-
Chapter and Conference Paper
HybridTuner: Tuning with Hybrid Derivative-Free Optimization Initialization Strategies
To utilize the full potential of advanced computer architectures, algorithms often need to be tuned to the architecture being used. We propose two hybrid derivative-free optimization (DFO) methods to maximize ...
-
Chapter and Conference Paper
Heat Exchanger Circuitry Design by Decision Diagrams
The interconnection pattern between the tubes of a tube-fin heat exchanger, also referred to as its circuitry, has a significant impact on its performance. We can improve the performance of a heat exchanger by...
-
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. ...
-
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 ...
-
Chapter
Introduction
Research in optimization attracted attention when significant advances were made in linear programming—the optimization of a linear objective over a linear constraint set—in the late 1940s. The focus of the op...
-
Chapter
The Implementation
BARON (Sahinidis 1996, Ghildyal & Sahinidis 2001, Sahinidis 1999–2000, Tawarmalani & Sahinidis 1999b, Sahinidis & Tawarmalani 2000), the branchand-reduce optimization navigator, includes an implementation of m...
-
Chapter
Relaxations of Factorable Programs
In Chapter 2, we developed a theory of convex extensions and formalized a technique for building tight relaxations. However, the size of the resulting relaxations can be exponential in the number of variables....
-
Chapter
Node Partitioning Schemes
In this chapter, we concentrate on branching strategies for mixed-integer nonlinear programs. We introduce the notion of an ideal violation and use it to develop a partitioning technique for factorable program...
-
Chapter
Refrigerant Design Problem
The enumeration of large, combinatorial search spaces presents a central conceptual difficulty in molecular design. To address this difficulty, we develop an algorithm which guarantees globally optimal solutio...
-
Chapter
Miscellaneous Problems
In this chapter, we provide computational experience with BARON on a variety of factorable nonlinear programs, including separable concave quadratic programs, indefinite quadratic programs, linear multiplicati...
-
Chapter
Product Disaggregation in Global Optimization and Relaxations of Rational Programs
In this chapter, 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 ...
-
Chapter
Domain Reduction
Domain reduction is the process of eliminating regions from the feasible space if the removal does not affect the convergence of the search process to a global optimum. Domain reduction is also referred to as ...
-
Chapter
The Pooling Problem
Convexification techniques based on disjunctive programming have been extensively employed to solve many hard combinatorial optimization problems. In this chapter, we demonstrate the potential of convexificati...
-
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...
-
Chapter
Solving Global Optimization Problems with Baron
The purpose of this paper is to report our progress to date towards the development of a general purpose global optimization system. The system has evolved from a 1800 line code initially written in the GAMS m...
-
Chapter
A Finite Algorithm for Global Minimization of Separable Concave Programs
Researchers first examined the problem of separable concave programming more than thirty years ago, making it one of the earliest branches nonlinear programming to be explored. This paper proposes a new finite...
-
Chapter
Planning of Chemical Process Networks via Global Concave Minimization
The problem of selecting processes and planning expansions of a chemical complex to maximize net present value has been traditionally formulated as a multiperiod, mixed-integer linear program. In this paper, t...
