Bi-Level Strategies in Semi-Infinite Programming
Bi-Level Strategies in Semi-Infinite Programming

Author: Oliver Stein

Publisher: Springer Science & Business Media

Published: 2013-12-01

Total Pages: 219

ISBN-13: 1441991646

DOWNLOAD EBOOK

Semi-infinite optimization is a vivid field of active research. Recently semi infinite optimization in a general form has attracted a lot of attention, not only because of its surprising structural aspects, but also due to the large number of applications which can be formulated as general semi-infinite programs. The aim of this book is to highlight structural aspects of general semi-infinite programming, to formulate optimality conditions which take this structure into account, and to give a conceptually new solution method. In fact, under certain assumptions general semi-infinite programs can be solved efficiently when their bi-Ievel structure is exploited appropriately. After a brief introduction with some historical background in Chapter 1 we be gin our presentation by a motivation for the appearance of standard and general semi-infinite optimization problems in applications. Chapter 2 lists a number of problems from engineering and economics which give rise to semi-infinite models, including (reverse) Chebyshev approximation, minimax problems, ro bust optimization, design centering, defect minimization problems for operator equations, and disjunctive programming.

Bilevel Optimization
Bilevel Optimization

Author: Stephan Dempe

Publisher: Springer Nature

Published: 2020-11-23

Total Pages: 679

ISBN-13: 3030521192

DOWNLOAD EBOOK

2019 marked the 85th anniversary of Heinrich Freiherr von Stackelberg’s habilitation thesis “Marktform und Gleichgewicht,” which formed the roots of bilevel optimization. Research on the topic has grown tremendously since its introduction in the field of mathematical optimization. Besides the substantial advances that have been made from the perspective of game theory, many sub-fields of bilevel optimization have emerged concerning optimal control, multiobjective optimization, energy and electricity markets, management science, security and many more. Each chapter of this book covers a specific aspect of bilevel optimization that has grown significantly or holds great potential to grow, and was written by top experts in the corresponding area. In other words, unlike other works on the subject, this book consists of surveys of different topics on bilevel optimization. Hence, it can serve as a point of departure for students and researchers beginning their research journey or pursuing related projects. It also provides a unique opportunity for experienced researchers in the field to learn about the progress made so far and directions that warrant further investigation. All chapters have been peer-reviewed by experts on mathematical optimization.

Topological Aspects of Nonsmooth Optimization
Topological Aspects of Nonsmooth Optimization

Author: Vladimir Shikhman

Publisher: Springer Science & Business Media

Published: 2011-11-18

Total Pages: 200

ISBN-13: 1461418976

DOWNLOAD EBOOK

This book deals with nonsmooth structures arising within the optimization setting. It considers four optimization problems, namely, mathematical programs with complementarity constraints, general semi-infinite programming problems, mathematical programs with vanishing constraints and bilevel optimization. The author uses the topological approach and topological invariants of corresponding feasible sets are investigated. Moreover, the critical point theory in the sense of Morse is presented and parametric and stability issues are considered. The material progresses systematically and establishes a comprehensive theory for a rather broad class of optimization problems tailored to their particular type of nonsmoothness. Topological Aspects of Nonsmooth Optimization will benefit researchers and graduate students in applied mathematics, especially those working in optimization theory, nonsmooth analysis, algebraic topology and singularity theory. ​ ​

Linear Semi-Infinite Optimization
Linear Semi-Infinite Optimization

Author: Miguel A. Goberna

Publisher:

Published: 1998-03-11

Total Pages: 380

ISBN-13:

DOWNLOAD EBOOK

A linear semi-infinite program is an optimization problem with linear objective functions and linear constraints in which either the number of unknowns or the number of constraints is finite. The many direct applications of linear semi-infinite optimization (or programming) have prompted considerable and increasing research effort in recent years. The authors' aim is to communicate the main theoretical ideas and applications techniques of this fascinating area, from the perspective of convex analysis. The four sections of the book cover: * Modelling with primal and dual problems - the primal problem, space of dual variables, the dual problem. * Linear semi-infinite systems - existence theorems, alternative theorems, redundancy phenomena, geometrical properties of the solution set. * Theory of linear semi-infinite programming - optimality, duality, boundedness, perturbations, well-posedness. * Methods of linear semi-infinite programming - an overview of the main numerical methods for primal and dual problems. Exercises and examples are provided to illustrate both theory and applications. The reader is assumed to be familiar with elementary calculus, linear algebra and general topology. An appendix on convex analysis is provided to ensure that the book is self-contained. Graduate students and researchers wishing to gain a deeper understanding of the main ideas behind the theory of linear optimization will find this book to be an essential text.

Global Optimization Algorithms for Semi-infinite and Generalized Semi-infinite Programs
Global Optimization Algorithms for Semi-infinite and Generalized Semi-infinite Programs

Author: Panayiotis Lemonidis

Publisher:

Published: 2008

Total Pages: 249

ISBN-13:

DOWNLOAD EBOOK

The goals of this thesis are the development of global optimization algorithms for semi-infinite and generalized semi-infinite programs and the application of these algorithms to kinetic model reduction. The outstanding issue with semi-infinite programming (SIP) was a methodology that could provide a certificate of global optimality on finite termination for SIP with nonconvex functions participating. We have developed the first methodology that can generate guaranteed feasible points for SIP and provide e-global optimality on finite termination. The algorithm has been implemented in a branch-and-bound (B & B) framework and uses discretization coupled with convexification for the lower bounding problem and the interval constrained reformulation for the upper bounding problem. Within the framework of SIP we have also proposed a number of feasible-point methods that all rely on the same basic principle; the relaxation of the lower-level problem causes a restriction of the outer problem and vice versa. All these methodologies were tested using the Watson test set. It was concluded that the concave overestimation of the SIP constraint using McCormcick relaxations and a KKT treatment of the resulting expression is the most computationally expensive method but provides tighter bounds than the interval constrained reformulation or a concave overestimator of the SIP constraint followed by linearization. All methods can work very efficiently for small problems (1-3 parameters) but suffer from the drawback that in order to converge to the global solution value the parameter set needs to subdivided. Therefore, for problems with more than 4 parameters, intractable subproblems arise very high in the B & B tree and render global solution of the whole problem infeasible.