In this book a general topological construction of extension is proposed for problems of attainability in topological spaces under perturbation of a system of constraints. This construction is realized in a special class of generalized elements defined as finitely additive measures. A version of the method of programmed iterations is constructed. This version realizes multi-valued control quasistrategies, which guarantees the solution of the control problem that consists in guidance to a given set under observation of phase constraints. Audience: The book will be of interest to researchers, and graduate students in the field of optimal control, mathematical systems theory, measure and integration, functional analysis, and general topology.

This volume presents state-of-the-art complementarity applications, algorithms, extensions and theory in the form of eighteen papers. These at the International Conference on Com invited papers were presented plementarity 99 (ICCP99) held in Madison, Wisconsin during June 9-12, 1999 with support from the National Science Foundation under Grant DMS-9970102. Complementarity is becoming more widely used in a variety of appli cation areas. In this volume, there are papers studying the impact of complementarity in such diverse fields as deregulation of electricity mar kets, engineering mechanics, optimal control and asset pricing. Further more, application of complementarity and optimization ideas to related problems in the burgeoning fields of machine learning and data mining are also covered in a series of three articles. In order to effectively process the complementarity problems that arise in such applications, various algorithmic, theoretical and computational extensions are covered in this volume. Nonsmooth analysis has an im portant role to play in this area as can be seen from articles using these tools to develop Newton and path following methods for constrained nonlinear systems and complementarity problems. Convergence issues are covered in the context of active set methods, global algorithms for pseudomonotone variational inequalities, successive convex relaxation and proximal point algorithms. Theoretical contributions to the connectedness of solution sets and constraint qualifications in the growing area of mathematical programs with equilibrium constraints are also presented. A relaxation approach is given for solving such problems. Finally, computational issues related to preprocessing mixed complementarity problems are addressed.

Introduces applied mathematicians and graduate students to an original relaxation method based on a continuous extension of various optimization problems relating to convex compactification; it can be applied to problems in optimal control theory, the calculus of variations, and non-cooperative game theory. Reviews the background and summarizes the general theory of convex compactifications, then uses it to obtain convex, locally compact envelopes of the Lebesague and Sobolev spaces involved in concrete problems. The nontrivial envelopes cover the classical Young measures as well as various generalizations of them, which can record the limit behavior of fast oscillation and concentration effects. Annotation copyrighted by Book News, Inc., Portland, OR

Circuit simulation has been a topic of great interest to the integrated circuit design community for many years. It is a difficult, and interesting, problem be cause circuit simulators are very heavily used, consuming thousands of computer hours every year, and therefore the algorithms must be very efficient. In addi tion, circuit simulators are heavily relied upon, with millions of dollars being gambled on their accuracy, and therefore the algorithms must be very robust. At the University of California, Berkeley, a great deal of research has been devoted to the study of both the numerical properties and the efficient imple mentation of circuit simulation algorithms. Research efforts have led to several programs, starting with CANCER in the 1960's and the enormously successful SPICE program in the early 1970's, to MOTIS-C, SPLICE, and RELAX in the late 1970's, and finally to SPLICE2 and RELAX2 in the 1980's. Our primary goal in writing this book was to present some of the results of our current research on the application of relaxation algorithms to circuit simu lation. As we began, we realized that a large body of mathematical and exper imental results had been amassed over the past twenty years by graduate students, professors, and industry researchers working on circuit simulation. It became a secondary goal to try to find an organization of this mass of material that was mathematically rigorous, had practical relevance, and still retained the natural intuitive simplicity of the circuit simulation subject.

The relaxation method has enjoyed an intensive development during many decades and this new edition of this comprehensive text reflects in particular the main achievements in the past 20 years. Moreover, many further improvements and extensions are included, both in the direction of optimal control and optimal design as well as in numerics and applications in materials science, along with an updated treatment of the abstract parts of the theory.

This book provides a comprehensive guide to analyzing and solving optimal design problems in continuous media by means of the so-called sub-relaxation method. Though the underlying ideas are borrowed from other, more classical approaches, here they are used and organized in a novel way, yielding a distinct perspective on how to approach this kind of optimization problems. Starting with a discussion of the background motivation, the book broadly explains the sub-relaxation method in general terms, helping readers to grasp, from the very beginning, the driving idea and where the text is heading. In addition to the analytical content of the method, it examines practical issues like optimality and numerical approximation. Though the primary focus is on the development of the method for the conductivity context, the book’s final two chapters explore several extensions of the method to other problems, as well as formal proofs. The text can be used for a graduate course in optimal design, even if the method would require some familiarity with the main analytical issues associated with this type of problems. This can be addressed with the help of the provided bibliography.