Jong-Shi Pang – författare

This two volume work presents a comprehensive treatment of the finite dimensional variational inequality and complementarity problem, covering the basic theory, iterative algorithms, and important applications. The authors provide a broad coverage of the finite dimensional variational inequality and complementarity problem beginning with the fundamental questions of existence and uniqueness of solutions, presenting the latest algorithms and results, extending into selected neighboring topics, summarizing many classical source problems, and suggesting novel application domains. This first volume contains the basic theory of finite dimensional variational inequalities and complementarity problems. This book should appeal to mathematicians, economists, and engineers working in the field.A set price of EUR 199 is offered for volume I and II bought at the same time. Please order at: orders@springer.de

The ?nite-dimensional nonlinear complementarity problem (NCP) is a s- tem of ?nitely many nonlinear inequalities in ?nitely many nonnegative variables along with a special equation that expresses the complementary relationship between the variables and corresponding inequalities. This complementarity condition is the key feature distinguishing the NCP from a general inequality system, lies at the heart of all constrained optimi- tion problems in ?nite dimensions, provides a powerful framework for the modeling of equilibria of many kinds, and exhibits a natural link between smooth and nonsmooth mathematics. The ?nite-dimensional variational inequality (VI), which is a generalization of the NCP, provides a broad unifying setting for the study of optimization and equilibrium problems and serves as the main computational framework for the practical solution of a host of continuum problems in the mathematical sciences. The systematic study of the ?nite-dimensional NCP and VI began in the mid-1960s; in a span of four decades, the subject has developed into a very fruitful discipline in the ?eld of mathematical programming. The - velopments include a rich mathematical theory, a host of e?ective solution algorithms, a multitude of interesting connections to numerous disciplines, and a wide range of important applications in engineering and economics. As a result of their broad associations, the literature of the VI/CP has bene?ted from contributions made by mathematicians (pure, applied, and computational), computer scientists, engineers of many kinds (civil, ch- ical, electrical, mechanical, and systems), and economists of diverse exp- tise (agricultural, computational, energy, ?nancial, and spatial).

This book provides a solid foundation and an extensive study for an important class of constrained optimization problems known as Mathematical Programs with Equilibrium Constraints (MPEC), which are extensions of bilevel optimization problems. The book begins with the description of many source problems arising from engineering and economics that are amenable to treatment by the MPEC methodology. Error bounds and parametric analysis are the main tools to establish a theory of exact penalisation, a set of MPEC constraint qualifications and the first-order and second-order optimality conditions. The book also describes several iterative algorithms such as a penalty-based interior point algorithm, an implicit programming algorithm and a piecewise sequential quadratic programming algorithm for MPECs. Results in the book are expected to have significant impacts in such disciplines as engineering design, economics and game equilibria, and transportation planning, within all of which MPEC has a central role to play in the modelling of many practical problems.

This book provides a solid foundation and an extensive study for an important class of constrained optimization problems known as Mathematical Programs with Equilibrium Constraints (MPEC), which are extensions of bilevel optimization problems. The book begins with the description of many source problems arising from engineering and economics that are amenable to treatment by the MPEC methodology. Error bounds and parametric analysis are the main tools to establish a theory of exact penalisation, a set of MPEC constraint qualifications and the first-order and second-order optimality conditions. The book also describes several iterative algorithms such as a penalty-based interior point algorithm, an implicit programming algorithm and a piecewise sequential quadratic programming algorithm for MPECs. Results in the book are expected to have significant impacts in such disciplines as engineering design, economics and game equilibria, and transportation planning, within all of which MPEC has a central role to play in the modelling of many practical problems.

This volume contains a collection of papers from experts in the field of complementarity on state-of-the-art applications, algorithms, extensions and theory, resulting in a contemporary view of the complete field of complementarity. The impact of complementarity in such diverse fields as deregulation of electricity markets, engineering mechanics, optimal control and asset pricing is described using both survey and current research articles. The papers outline problem classes where complementarity can be used to model both physical and structural phenomena in ways that lead to new solution approaches. The novel application of complementarity and optimization ideas to problems in the burgeoning fields of machine learning and data mining is covered. New algorithmic advances including preprocessing and nonmonotone searches, extensions of computational methods using tools from nonsmooth analysis, and related theory for mathematical programs with equilibrium constraints is also detailed.

This collection of papers covers a wide spectrum of computational optimization topics, representing a blend of familiar nonlinear programming topics and such novel paradigms as semidefinite programming and complementarity-constrained nonlinear programs. An informal categorization of the papers includes algorithmic advances for special classes of constrained optimization problems, analysis of linear and nonlinear programs, algorithmic advances, B-stationary points of mathematical programs with equilibrium constraints, applications of optimization, some mathematical topics and systems of nonlinear equations.

The ?nite-dimensional nonlinear complementarity problem (NCP) is a s- tem of ?nitely many nonlinear inequalities in ?nitely many nonnegative variables along with a special equation that expresses the complementary relationship between the variables and corresponding inequalities. This complementarity condition is the key feature distinguishing the NCP from a general inequality system, lies at the heart of all constrained optimi- tion problems in ?nite dimensions, provides a powerful framework for the modeling of equilibria of many kinds, and exhibits a natural link between smooth and nonsmooth mathematics. The ?nite-dimensional variational inequality (VI), which is a generalization of the NCP, provides a broad unifying setting for the study of optimization and equilibrium problems and serves as the main computational framework for the practical solution of a host of continuum problems in the mathematical sciences. The systematic study of the ?nite-dimensional NCP and VI began in the mid-1960s; in a span of four decades, the subject has developed into a very fruitful discipline in the ?eld of mathematical programming. The - velopments include a rich mathematical theory, a host of e?ective solution algorithms, a multitude of interesting connections to numerous disciplines, and a wide range of important applications in engineering and economics. As a result of their broad associations, the literature of the VI/CP has bene?ted from contributions made by mathematicians (pure, applied, and computational), computer scientists, engineers of many kinds (civil, ch- ical, electrical, mechanical, and systems), and economists of diverse exp- tise (agricultural, computational, energy, ?nancial, and spatial).

The ?nite-dimensional nonlinear complementarity problem (NCP) is a s- tem of ?nitely many nonlinear inequalities in ?nitely many nonnegative variables along with a special equation that expresses the complementary relationship between the variables and corresponding inequalities. This complementarity condition is the key feature distinguishing the NCP from a general inequality system, lies at the heart of all constrained optimi- tion problems in ?nite dimensions, provides a powerful framework for the modeling of equilibria of many kinds, and exhibits a natural link between smooth and nonsmooth mathematics. The ?nite-dimensional variational inequality (VI), which is a generalization of the NCP, provides a broad unifying setting for the study of optimization and equilibrium problems and serves as the main computational framework for the practical solution of a host of continuum problems in the mathematical sciences. The systematic study of the ?nite-dimensional NCP and VI began in the mid-1960s; in a span of four decades, the subject has developed into a very fruitful discipline in the ?eld of mathematical programming. The - velopments include a rich mathematical theory, a host of e?ective solution algorithms, a multitude of interesting connections to numerous disciplines, and a wide range of important applications in engineering and economics. As a result of their broad associations, the literature of the VI/CP has bene?ted from contributions made by mathematicians (pure, applied, and computational), computer scientists, engineers of many kinds (civil, ch- ical, electrical, mechanical, and systems), and economists of diverse exp- tise (agricultural, computational, energy, ?nancial, and spatial).

This volume contains a collection of papers from experts in the field of complementarity on state-of-the-art applications, algorithms, extensions and theory, resulting in a contemporary view of the complete field of complementarity. The impact of complementarity in such diverse fields as deregulation of electricity markets, engineering mechanics, optimal control and asset pricing is described using both survey and current research articles. The papers outline problem classes where complementarity can be used to model both physical and structural phenomena in ways that lead to new solution approaches. The novel application of complementarity and optimization ideas to problems in the burgeoning fields of machine learning and data mining is covered. New algorithmic advances including preprocessing and nonmonotone searches, extensions of computational methods using tools from nonsmooth analysis, and related theory for mathematical programs with equilibrium constraints is also detailed. Audience: Researchers and advanced students working in optimization and management sciences.

Computational Optimization: A Tribute to Olvi Mangasarian serves as an excellent reference, providing insight into some of the most challenging research issues in the field. This collection of papers covers a wide spectrum of computational optimization topics, representing a blend of familiar nonlinear programming topics and such novel paradigms as semidefinite programming and complementarity-constrained nonlinear programs. Many new results are presented in these papers which are bound to inspire further research and generate new avenues for applications. An informal categorization of the papers includes: Algorithmic advances for special classes of constrained optimization problems Analysis of linear and nonlinear programs Algorithmic advances B- stationary points of mathematical programs with equilibrium constraints Applications of optimization Some mathematical topics Systems of nonlinear equations.

Starting with the fundamentals of classical smooth optimization and building on established convex programming techniques, this research monograph presents a foundation and methodology for modern nonconvex nondifferentiable optimization. It provides readers with theory, methods, and applications of nonconvex and nondifferentiable optimization in statistical estimation, operations research, machine learning, and decision making. A comprehensive and rigorous treatment of this emergent mathematical topic is urgently needed in today's complex world of big data and machine learning. This book takes a thorough approach to the subject and includes examples and exercises to enrich the main themes, making it suitable for classroom instruction. Modern Nonconvex Nondifferentiable Optimization is intended for applied and computational mathematicians, optimizers, operations researchers, statisticians, computer scientists, engineers, economists, and machine learners. It could be used in advanced courses on optimization/operations research and nonconvex and nonsmooth optimization.