There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida."

Presently, general-purpose optimization techniques such as Simulated Annealing, and Genetic Algorithms, have become standard optimization techniques. Concerted research efforts have been made recently in order to invent novel optimization techniques for solving real life problems, which have the attributes of memory update and population-based search solutions. The book describes a variety of these novel optimization techniques which in most cases outperform the standard optimization techniques in many application areas. New Optimization Techniques in Engineering reports applications and results of the novel optimization techniques considering a multitude of practical problems in the different engineering disciplines presenting both the background of the subject area and the techniques for solving the problems. "

This book is the first serious attempt to gather all of the available theory of "nonharmonic Fourier series" in one place, combining published results with new results by the authors.

Borwein is an authority in the area of mathematical optimization, and his book makes an important contribution to variational analysis

Provides a good introduction to the topic

Decomposable sets since T. R. Rockafellar in 1968 are one of basic notions in nonlinear analysis, especially in the theory of multifunctions. A subset K of measurable functions is called decomposable if

(Q) for all and measurable A.

This book attempts to show the present stage of "decomposable analysis" from the point of view of fixed point theory. The book is split into three parts, beginning with the background of functional analysis, proceeding to the theory of multifunctions and lastly, the decomposability property.

Mathematicians and students working in functional, convex and nonlinear analysis, differential inclusions and optimal control should find this book of interest. A good background in fixed point theory is assumed as is a background in topology.

Focusing on the study of nonsmooth vector functions, this book presents a comprehensive account of the calculus of generalized Jacobian matrices and their applications to continuous nonsmooth optimization problems, as well as variational inequalities in finite dimensions. The treatment is motivated by a desire to expose an elementary approach to nonsmooth calculus, using a set of matrices to replace the nonexistent Jacobian matrix of a continuous vector function.

Classicalexamples of moreand more oscillatingreal-valued functions on a domain N ?of R are the functions u (x)=sin(nx)with x=(x ,...,x ) or the so-called n 1 1 n n+1 Rademacherfunctionson]0,1[,u (x)=r (x) = sgn(sin(2 ?x))(seelater3.1.4). n n They may appear as the gradients?v of minimizing sequences (v ) in some n n n?N variationalproblems. Intheseexamples,thefunctionu convergesinsomesenseto n ameasure on ? xR, called Young measure. In Functional Analysis formulation, this is the narrow convergence to of the image of the Lebesgue measure on ? by ? ? (?,u (?)). In the disintegrated form ( ) ,the parametrized measure n ? ??? ? captures the possible scattering of the u around ?. n Curiously if (X ) is a sequence of random variables deriving from indep- n n?N dent ones, the n-th one may appear more and more far from the k ?rst ones as 2 if it was oscillating (think of orthonormal vectors in L which converge weakly to 0). More precisely when the laws L(X ) narrowly converge to some probability n measure , it often happens that for any k and any A in the algebra generated by X ,...,X , the conditional law L(X|A) still converges to (see Chapter 9) 1 k n which means 1 ??? C (R) ?(X (?))dP(?)?? ?d b n P(A) A R or equivalently, ? denoting the image of P by ? ? (?,X (?)), n X n (1l ??)d? ?? (1l ??)d[P? ].

Stochastic programming is the study of procedures for decision making under the presence of uncertainties and risks. Stochastic programming approaches have been successfully used in a number of areas such as energy and production planning, telecommunications, and transportation. Recently, the practical experience gained in stochastic programming has been expanded to a much larger spectrum of applications including financial modeling, risk management, and probabilistic risk analysis. Major topics in this volume include: (1) advances in theory and implementation of stochastic programming algorithms; (2) sensitivity analysis of stochastic systems; (3) stochastic programming applications and other related topics. Audience: Researchers and academies working in optimization, computer modeling, operations research and financial engineering. The book is appropriate as supplementary reading in courses on optimization and financial engineering.

This book is a practical guide to the application of control benchmarking to real, complex, industrial processes. The variety of industrial case studies gives the benchmarking ideas presented a robust real-world attitude. The book deals with control engineering principles and economic and management aspects of benchmarking. It shows the reader how to avoid common problems in benchmarking and details the benefits of effective benchmarking.

Richard Bellmann developed a theory of dynamic programming which is for many reasons still in the center of great interest. The authors present a new approach in the ?eld of the optimization and multi-objective control of time-discrete systems which is closely related to the work of Richard Bellmann. They develop their own concept and their extension to the optimization and multi-objective control of time-discrete systems as well as to dynamic networks and multilayered structures are very stimulating for further research. Di?erent perspectives of discrete control and optimal dynamic ?ow problems on networks are treated and characterized. Together with the algorithmic solutions a framework of multi-objective control problems is - rived. The conclusion with a real world example underlines the necessity and - portance of their theoretic framework. As they come back to the classical Bellmann concept of dynamic programming they stress and honor his basic concept without debase their own work. Multilayereddecisionprocessesaspartofthedesignandanalysisofcomplexsystems and networks will be essential in many ways and ?elds in the future.

Interest in regularization methods for ill-posed nonlinear operator equations and variational inequalities of monotone type in Hilbert and Banach spaces has grown rapidly over recent years. Results in the field over the last three decades, previously only available in journal articles, are comprehensively explored with particular attention given to applications of regularization methods as well as to practical methods used in computational analysis.

H-infinity control theory deals with the minimization of the H-norm of the transfer matrix from an exogenous disturbance to a pertinent controlled output of a given plant. This comprehensive book examines both the theoretical and practical aspects of H-infinity control from the angle of the structural properties of linear systems.

This, the fourth edition of Stuwe 's book on the calculus of variations, surveys new developments in this exciting field. It also gives a concise introduction to variational methods. In particular it includes the proof for the convergence of the Yamabe flow and a detailed treatment of the phenomenon of blow-up. Recently discovered results for backward bubbling in the heat flow for harmonic maps or surfaces are discussed. A number of changes have been made throughout the text.

For a long time the techniques of solving linear optimization (LP) problems improved only marginally. Fifteen years ago, however, a revolutionary discovery changed everything. A new `golden age' for optimization started, which is continuing up to the current time. What is the cause of the excitement? Techniques of linear programming formed previously an isolated body of knowledge. Then suddenly a tunnel was built linking it with a rich and promising land, part of which was already cultivated, part of which was completely unexplored. These revolutionary new techniques are now applied to solve conic linear problems. This makes it possible to model and solve large classes of essentially nonlinear optimization problems as efficiently as LP problems. This volume gives an overview of the latest developments of such `High Performance Optimization Techniques'. The first part is a thorough treatment of interior point methods for semidefinite programming problems. The second part reviews today's most exciting research topics and results in the area of convex optimization. Audience: This volume is for graduate students and researchers who are interested in modern optimization techniques.

There has been much excitement over the emergence of new mathematical techniques for the analysis and control of nonlinear systems. In addition, great technological advances have bolstered the impact of analytic advances and produced many new problems and applications which are nonlinear in an essential way. This book lays out in a concise mathematical framework the tools and methods of analysis which underlie this diversity of applications.

This volume summarizes and synthesizes an aspect of research work that has been done in the area of Generalized Convexity over the past few decades. Specifically, the book focuses on V-invex functions in vector optimization that have grown out of the work of Jeyakumar and Mond in the 1990 s. The authors integrate related research into the book and demonstrate the wide context from which the area has grown and continues to grow.

Industrial production is one of the most basic human activities indispensable to the economic activity. Due to its complexity, production is not very well understood and modeled as opposed to traditional fields of inquiry such as physics. This book aims at enhancing rigorous understanding of a particular area of production, that of analysis and optimization of production lines and networks using discrete event models and simulation. To our knowledge, this is the first book treating this subject from the point of view mentioned above. We have arrived at the realization that discrete event models and simulation provide perhaps the best tools to model production lines and networks for a number of reasons. Analysis is precise but demands enormous computational resources, usually unavailable in practical situations. Brute force simulation is also precise but slow when quick decisions are to be made. Approximate analytical models are fast but often unreliable as far as accuracy is concerned. The approach of the book, on the other hand, combines speed and accuracy to an exceptional degree in most practical applications.

Conjugate direction methods were proposed in the early 1950s. When high speed digital computing machines were developed, attempts were made to lay the fo- dations for the mathematical aspects of computations which could take advantage of the ef?ciency of digital computers. The National Bureau of Standards sponsored the Institute for Numerical Analysis, which was established at the University of California in Los Angeles. A seminar held there on numerical methods for linear equationswasattendedbyMagnusHestenes, EduardStiefel andCorneliusLanczos. This led to the ?rst communication between Lanczos and Hestenes (researchers of the NBS) and Stiefel (of the ETH in Zurich) on the conjugate direction algorithm. The method is attributed to Hestenes and Stiefel who published their joint paper in 1952 [101] in which they presented both the method of conjugate gradient and the conjugate direction methods including conjugate Gram-Schmidt processes. A closelyrelatedalgorithmwasproposedbyLanczos[114]whoworkedonalgorithms for determiningeigenvalues of a matrix. His iterative algorithm yields the similarity transformation of a matrix into the tridiagonal form from which eigenvalues can be well approximated.Thethree-termrecurrencerelationofthe Lanczosprocedurecan be obtained by eliminating a vector from the conjugate direction algorithm scheme. Initially the conjugate gradient algorithm was called the Hestenes-Stiefel-Lanczos method [86].

Substantially revised, reorganised and updated, the second edition now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems.

As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem.

Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject.

Performance optimization is vital in the design and operation of modern engineering systems, including communications, manufacturing, robotics, and logistics. Most engineering systems are too complicated to model, or the system parameters cannot be easily identified, so learning techniques have to be applied. This book provides a unified framework based on a sensitivity point of view. It also introduces new approaches and proposes new research topics within this sensitivity-based framework. This new perspective on a popular topic is presented by a well respected expert in the field.

Multilevel decision theory arises to resolve the contradiction between increasing requirements towards the process of design, synthesis, control and management of complex systems and the limitation of the power of technical, control, computer and other executive devices, which have to perform actions and to satisfy requirements in real time. This theory rises suggestions how to replace the centralised management of the system by hierarchical co-ordination of sub-processes. All sub-processes have lower dimensions, which support easier management and decision making. But the sub-processes are interconnected and they influence each other. Multilevel systems theory supports two main methodological tools: decomposition and co-ordination. Both have been developed, and implemented in practical applications concerning design, control and management of complex systems. In general, it is always beneficial to find the best or optimal solution in processes of system design, control and management. The real tendency towards the best (optimal) decision requires to present all activities in the form of a definition and then the solution of an appropriate optimization problem. Every optimization process needs the mathematical definition and solution of a well stated optimization problem. These problems belong to two classes: static optimization and dynamic optimization. Static optimization problems are solved applying methods of mathematical programming: conditional and unconditional optimization. Dynamic optimization problems are solved by methods of variation calculus: Euler Lagrange method; maximum principle; dynamical programming.

This is the first volume of a three-volume introduction to modern geometry, with emphasis on applications to other areas of mathematics and theoretical physics. Topics covered include tensors and their differential calculus, the calculus of variations in one and several dimensions, and geometric field theory. This material is explained in as simple and concrete a language as possible, in a terminology acceptable to physicists. The text for the second edition has been substantially revised.

In recent years much attention has been given to the development of auto matic systems of planning, design and control in various branches of the national economy. Quality of decisions is an issue which has come to the forefront, increasing the significance of optimization algorithms in math ematical software packages for al, ltomatic systems of various levels and pur poses. Methods for minimizing functions with discontinuous gradients are gaining in importance and the xperts in the computational methods of mathematical programming tend to agree that progress in the development of algorithms for minimizing nonsmooth functions is the key to the con struction of efficient techniques for solving large scale problems. This monograph summarizes to a certain extent fifteen years of the author's work on developing generalized gradient methods for nonsmooth minimization. This work started in the department of economic cybernetics of the Institute of Cybernetics of the Ukrainian Academy of Sciences under the supervision of V.S. Mikhalevich, a member of the Ukrainian Academy of Sciences, in connection with the need for solutions to important, practical problems of optimal planning and design. In Chap. I we describe basic classes of nonsmooth functions that are dif ferentiable almost everywhere, and analyze various ways of defining generalized gradient sets. In Chap. 2 we study in detail various versions of the su bgradient method, show their relation to the methods of Fejer-type approximations and briefly present the fundamentals of e-subgradient methods."

This handbook provides an in-depth examination of important theoretical methods and procedures in applied analysis. It details many of the most important theoretical trends in nonlinear analysis and applications to different fields. These features make the volume a valuable tool for every researcher working on nonlinear analysis.

The primary aim of this monograph is to provide a formal framework for the representation and management of uncertainty and vagueness in the field of artificial intelligence. It puts particular emphasis on a thorough analysis of these phenomena and on the development of sound mathematical modeling approaches. Beyond this theoretical basis the scope of the book includes also implementational aspects and a valuation of existing models and systems. The fundamental ambition of this book is to show that vagueness and un certainty can be handled adequately by using measure-theoretic methods. The presentation of applicable knowledge representation formalisms and reasoning algorithms substantiates the claim that efficiency requirements do not necessar ily require renunciation of an uncompromising mathematical modeling. These results are used to evaluate systems based on probabilistic methods as well as on non-standard concepts such as certainty factors, fuzzy sets or belief functions. The book is intended to be self-contained and addresses researchers and practioneers in the field of knowledge based systems. It is in particular suit able as a textbook for graduate-level students in AI, operations research and applied probability. A solid mathematical background is necessary for reading this book. Essential parts of the material have been the subject of courses given by the first author for students of computer science and mathematics held since 1984 at the University in Braunschweig."