Discrete H¿ Optimization is concerned with the study of H¿ optimization for digital signal processing and discrete-time control systems. The first three chapters present the basic theory and standard methods in digital filtering and systems from the frequency-domain approach, followed by a discussion of the general theory of approximation in Hardy spaces. AAK theory is introduced, first for finite-rank operators and then more generally, before being extended to the multi-input/multi-output setting. This mathematically rigorous book is self-contained and suitable for self-study. The advanced mathematical results derived here are applicable to digital control systems and digital filtering.

Discrete H¿ Optimization is concerned with the study of H¿ optimization for digital signal processing and discrete-time control systems. The first three chapters present the basic theory and standard methods in digital filtering and systems from the frequency-domain approach, followed by a discussion of the general theory of approximation in Hardy spaces. AAK theory is introduced, first for finite-rank operators and then more generally, before being extended to the multi-input/multi-output setting. This mathematically rigorous book is self-contained and suitable for self-study. The advanced mathematical results derived here are applicable to digital control systems and digital filtering.

This book aims to demonstrate and detail the pervasive nature of Discrete Optimization. The handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It is done with an academic treatment outlining the state-of-the-art for researchers across the domains of the Computer Science, Math Programming, Applied Mathematics, Engineering, and Operations Research. The book utilizes the tools of mathematical modeling, optimization, and integer programming to solve a broad range of modern problems.

One of the main accomplishments of control in the 1980s was the development of H8 techniques. This book teaches control system design using H8 methods. Students will find this book easy to use because it is conceptually simple. They will find it useful because of the widespread appeal of classical frequency domain methods. Classical control has always been presented as trial and error applied to specific cases; Helton and Merino provide a much more precise approach. This has the tremendous advantage of converting an engineering problem to one that can be put directly into a mathematical optimization package. After completing this course, students will be familiar with how engineering specs are coded as precise mathematical constraints.

One of the most frequently occurring types of optimization problems involves decision variables which have to take integer values. From a practical point of view, such problems occur in countless areas of management, engineering, administration, etc., and include such problems as location of plants or warehouses, scheduling of aircraft, cutting raw materials to prescribed dimensions, design of computer chips, increasing reliability or capacity of networks, etc. This is the class of problems known in the professional literature as "discrete optimization" problems. While these problems are of enormous applicability, they present many challenges from a computational point of view. This volume is an update on the impressive progress achieved by mathematicians, operations researchers, and computer scientists in solving discrete optimization problems of very large sizes. The surveys in this volume present a comprehensive overview of the state of the art in discrete optimization and are written by the most prominent researchers from all over the world.This volume describes the tremendous progress in discrete optimization achieved in the last 20 years since the publication of Discrete Optimization '77, Annals of Discrete Mathematics, volumes 4 and 5, 1979 (Elsevier). It contains surveys of the state of the art written by the most prominent researchers in the field from all over the world, and covers topics like neighborhood search techniques, lift and project for mixed 0-1 programming, pseudo-Boolean optimization, scheduling and assignment problems, production planning, location, bin packing, cutting planes, vehicle routing, and applications to graph theory, mechanics, chip design, etc.Key features:• state of the art surveys• comprehensiveness• prominent authors• theoretical, computational and applied aspects.This book is a reprint of Discrete Applied Mathematics Volume 23, Numbers 1-3

​Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas. The inspiring Fejes Tóth Lecture Series, delivered by Thomas Hales of the University of Pittsburgh, exemplified this approach. While these fields have recently witnessed a lot of activity and successes, many questions remain open. For example, Fields medalist Stephen Smale stated that the question of the existence of a strongly polynomial time algorithm for linear optimization is one of the most important unsolved problems at the beginning of the 21st century. The broad range of topics covered in this volume demonstrates the many recent and fruitful connections between different approaches, and features novel results and state-of-the-art surveys as well as open problems.