Global optimization with piecewise linear approximation

Date

2015-05

Authors

Vasudeva, Vivek

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Global optimization deals with the development of solution methodologies for nonlinear nonconvex optimization problems. These problems, which could arise in diverse situations ranging from optimizing hydro-power generation schedules to estimating coefficients of non-linear regression models, are difficult for traditional nonlinear solvers that iteratively search the neighborhood around a starting point. The Piecewise Linear Approximation (PLA) method that we study in this dissertation seeks to generate ‘good’ starting points, hopefully ones that lie in the basin of attraction of the globally optimal solution. In this approach, we approximate the non-linear functions in the optimization problem by piecewise linear functions defined over the vertices of a grid that partitions the domain of each nonlinear function into cells. Based on this approximation, we convert the original nonlinear program into a mixed integer program (MIP) and use the solution to this MIP as a starting point for a local nonlinear solver. In this dissertation, we validate the effectiveness of the PLA approach as a global optimization approach by applying it to a diverse set of continuous and discrete nonlinear optimization problems. Further, we develop various modeling and algorithmic strategies for enhancing the basic approach. Our computational results demonstrate that the PLA approach works well on non-convex problems and can, in some cases, provide better solutions than those provided by existing nonlinear solvers.

Description

text

LCSH Subject Headings

Citation