PDF Download

The current form of modern approximation theory is shaped by many new de velopments which are the subject of this series of conferences. The International Meetings on Approximation Theory attempt to keep track in particular of fun damental advances in the theory of function approximation, for example by (or thogonal) polynomials, (weighted) interpolation, multivariate quasi-interpolation, splines, radial basis functions and several others. This includes both approxima tion order and error estimates, as well as constructions of function systems for approximation of functions on Euclidean spaces and spheres. It is a piece of very good fortune that at all of the IDoMAT meetings, col leagues and friends from all over Europe, and indeed some count ries outside Europe and as far away as China, New Zealand, South Africa and U.S.A. came and dis cussed mathematics at IDoMAT conference facility in Witten-Bommerholz. The conference was, as always, held in a friendly and congenial atmosphere. After each meeting, the delegat es were invited to contribute to the proceed ing's volume, the previous one being published in the same Birkhäuser series as this one. The editors were pleased about the quality of the contributions which could be solicited for the book. They are refereed and we should mention our gratitude to the referees and their work.

In the last 30 years, Approximation Theory has undergone wonderful develop ment, with many new theories appearing in this short interval. This book has its origin in the wish to adequately describe this development, in particular, to rewrite the short 1966 book of G. G. Lorentz, "Approximation of Functions." Soon after 1980, R. A. DeVore and Lorentz joined forces for this purpose. The outcome has been their "Constructive Approximation" (1993), volume 303 of this series. References to this book are given as, for example rCA, p.201]. Later, M. v. Golitschek and Y. Makovoz joined Lorentz to produce the present book, as a continuation of the first. Completeness has not been our goal. In some of the theories, our exposition offers a selection of important, representative theorems, some other cases are treated more systematically. As in the first book, we treat only approximation of functions of one real variable. Thus, functions of several variables, complex approximation or interpolation are not treated, although complex variable methods appear often.

In the last 30 years, Approximation Theory has undergone wonderful develop ment, with many new theories appearing in this short interval. This book has its origin in the wish to adequately describe this development, in particular, to rewrite the short 1966 book of G. G. Lorentz, "Approximation of Functions." Soon after 1980, R. A. DeVore and Lorentz joined forces for this purpose. The outcome has been their "Constructive Approximation" (1993), volume 303 of this series. References to this book are given as, for example rCA, p.201]. Later, M. v. Golitschek and Y. Makovoz joined Lorentz to produce the present book, as a continuation of the first. Completeness has not been our goal. In some of the theories, our exposition offers a selection of important, representative theorems, some other cases are treated more systematically. As in the first book, we treat only approximation of functions of one real variable. Thus, functions of several variables, complex approximation or interpolation are not treated, although complex variable methods appear often.

Coupled with its sequel, this book gives a connected, unified exposition of Approximation Theory for functions of one real variable. It describes spaces of functions such as Sobolev, Lipschitz, Besov rearrangement-invariant function spaces and interpolation of operators. Other topics include Weierstrauss and best approximation theorems, properties of polynomials and splines. It contains history and proofs with an emphasis on principal results.

This volume contains contributions from international experts in the fields of constructive approximation. This area has reached out to encompass the computational and approximation-theoretical aspects of various interesting fields in applied mathematics.

The works of George G. Lorentz, spanning more than 60 years, have played a significant role in the development and evolution of mathematical analysis. The papers presented in this volume represent a selection of his best works, along with commentary from his students and colleagues.

A thorough, self-contained and easily accessible treatment of the theory on the polynomial best approximation of functions with respect to maximum norms. The topics include Chebychev theory, Weierstraß theorems, smoothness of functions, and continuation of functions.

This monograph presents a new theory for analysis, comparison and design of nonlinear smoothers, linking to established practices. Although a part of mathematical morphology, the special properties yield many simple, powerful and illuminating results leading to a novel nonlinear multiresolution analysis with pulses that may be as natural to vision as wavelet analysis is to acoustics. Similar to median transforms, they have the advantages of a supporting theory, computational simplicity, remarkable consistency, full trend preservation, and a Parceval-type identity. Although the perspective is new and unfamiliar to most, the reader can verify all the ideas and results with simple simulations on a computer at each stage. The framework developed turns out to be a part of mathematical morphology, but the additional specific structures and properties yield a heuristic understanding that is easy to absorb for practitioners in the fields like signal- and image processing. The book targets mathematicians, scientists and engineers with interest in concepts like trend, pulse, smoothness and resolution in sequences.

Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevariables are called mixed integer nonlinear programs (MINLP). Such problems arise in many ?elds, such as process industry, engineering design, communications, and ?nance. There is currently a huge gap between MINLP and mixed integer linear programming(MIP) solvertechnology.With a modernstate-of-the-artMIP solver itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree or four orders of magnitude. It is theoretically possible to approximate a general MINLP by a MIP with arbitrary precision. However, good MIP approximations are usually much larger than the original problem. Moreover, the approximation of nonlinear functions by piecewise linear functions can be di?cult and ti- consuming. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible. So far generic BCP frameworks have been developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS (OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP, the following points have to be taken into account: • A given (sparse) MINLP is reformulated as a block-separable program with linear coupling constraints.The block structure makes it possible to generate Lagrangian cuts and to apply Lagrangian heuristics. • In order to facilitate the generation of polyhedral relaxations, nonlinear c- vex relaxations are constructed. • The MINLP separation and pricing subproblems for generating cuts and columns are solved with specialized MINLP solvers.