Nonsmooth Optimization: Analysis And Algorithms With Applications To Optimal Control

Nonsmooth Optimization: Analysis And Algorithms With Applications To Optimal Control
Author: Marko M Makela
Publisher: World Scientific
Total Pages: 268
Release: 1992-05-07
Genre: Mathematics
ISBN: 9814522414

This book is a self-contained elementary study for nonsmooth analysis and optimization, and their use in solution of nonsmooth optimal control problems. The first part of the book is concerned with nonsmooth differential calculus containing necessary tools for nonsmooth optimization. The second part is devoted to the methods of nonsmooth optimization and their development. A proximal bundle method for nonsmooth nonconvex optimization subject to nonsmooth constraints is constructed. In the last part nonsmooth optimization is applied to problems arising from optimal control of systems covered by partial differential equations. Several practical problems, like process control and optimal shape design problems are considered.

Optimization and Control with Applications

Optimization and Control with Applications
Author: Liqun Qi
Publisher: Springer Science & Business Media
Total Pages: 587
Release: 2006-03-30
Genre: Mathematics
ISBN: 0387242554

A collection of 28 refereed papers grouped according to four broad topics: duality and optimality conditions, optimization algorithms, optimal control, and variational inequality and equilibrium problems. Suitable for researchers, practitioners and postgrads.

Nonlinear Programming

Nonlinear Programming
Author: Lorenz T. Biegler
Publisher: SIAM
Total Pages: 411
Release: 2010-01-01
Genre: Science
ISBN: 0898719380

This book addresses modern nonlinear programming (NLP) concepts and algorithms, especially as they apply to challenging applications in chemical process engineering. The author provides a firm grounding in fundamental NLP properties and algorithms, and relates them to real-world problem classes in process optimization, thus making the material understandable and useful to chemical engineers and experts in mathematical optimization.

Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models

Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models
Author: F. Giannessi
Publisher: Springer Science & Business Media
Total Pages: 304
Release: 2006-04-11
Genre: Mathematics
ISBN: 0306480263

The aim of the book is to cover the three fundamental aspects of research in equilibrium problems: the statement problem and its formulation using mainly variational methods, its theoretical solution by means of classical and new variational tools, the calculus of solutions and applications in concrete cases. The book shows how many equilibrium problems follow a general law (the so-called user equilibrium condition). Such law allows us to express the problem in terms of variational inequalities. Variational inequalities provide a powerful methodology, by which existence and calculation of the solution can be obtained.

Introduction to Functional Analysis

Introduction to Functional Analysis
Author: Christian Clason
Publisher: Springer Nature
Total Pages: 166
Release: 2020-11-30
Genre: Mathematics
ISBN: 3030527840

Functional analysis has become one of the essential foundations of modern applied mathematics in the last decades, from the theory and numerical solution of differential equations, from optimization and probability theory to medical imaging and mathematical image processing. This textbook offers a compact introduction to the theory and is designed to be used during one semester, fitting exactly 26 lectures of 90 minutes each. It ranges from the topological fundamentals recalled from basic lectures on real analysis to spectral theory in Hilbert spaces. Special attention is given to the central results on dual spaces and weak convergence.

Nonsmooth Approach to Optimization Problems with Equilibrium Constraints

Nonsmooth Approach to Optimization Problems with Equilibrium Constraints
Author: Jiri Outrata
Publisher: Springer Science & Business Media
Total Pages: 281
Release: 2013-06-29
Genre: Mathematics
ISBN: 1475728255

In the early fifties, applied mathematicians, engineers and economists started to pay c10se attention to the optimization problems in which another (lower-Ievel) optimization problem arises as a side constraint. One of the motivating factors was the concept of the Stackelberg solution in game theory, together with its economic applications. Other problems have been encountered in the seventies in natural sciences and engineering. Many of them are of practical importance and have been extensively studied, mainly from the theoretical point of view. Later, applications to mechanics and network design have lead to an extension of the problem formulation: Constraints in form of variation al inequalities and complementarity problems were also admitted. The term "generalized bi level programming problems" was used at first but later, probably in Harker and Pang, 1988, a different terminology was introduced: Mathematical programs with equilibrium constraints, or simply, MPECs. In this book we adhere to MPEC terminology. A large number of papers deals with MPECs but, to our knowledge, there is only one monograph (Luo et al. , 1997). This monograph concentrates on optimality conditions and numerical methods. Our book is oriented similarly, but we focus on those MPECs which can be treated by the implicit programming approach: the equilibrium constraint locally defines a certain implicit function and allows to convert the problem into a mathematical program with a nonsmooth objective.

Algorithms for Worst-Case Design and Applications to Risk Management

Algorithms for Worst-Case Design and Applications to Risk Management
Author: Berç Rustem
Publisher: Princeton University Press
Total Pages: 405
Release: 2009-02-09
Genre: Mathematics
ISBN: 1400825113

Recognizing that robust decision making is vital in risk management, this book provides concepts and algorithms for computing the best decision in view of the worst-case scenario. The main tool used is minimax, which ensures robust policies with guaranteed optimal performance that will improve further if the worst case is not realized. The applications considered are drawn from finance, but the design and algorithms presented are equally applicable to problems of economic policy, engineering design, and other areas of decision making. Critically, worst-case design addresses not only Armageddon-type uncertainty. Indeed, the determination of the worst case becomes nontrivial when faced with numerous--possibly infinite--and reasonably likely rival scenarios. Optimality does not depend on any single scenario but on all the scenarios under consideration. Worst-case optimal decisions provide guaranteed optimal performance for systems operating within the specified scenario range indicating the uncertainty. The noninferiority of minimax solutions--which also offer the possibility of multiple maxima--ensures this optimality. Worst-case design is not intended to necessarily replace expected value optimization when the underlying uncertainty is stochastic. However, wise decision making requires the justification of policies based on expected value optimization in view of the worst-case scenario. Conversely, the cost of the assured performance provided by robust worst-case decision making needs to be evaluated relative to optimal expected values. Written for postgraduate students and researchers engaged in optimization, engineering design, economics, and finance, this book will also be invaluable to practitioners in risk management.

Nonsmooth Equations in Optimization

Nonsmooth Equations in Optimization
Author: Diethard Klatte
Publisher: Springer Science & Business Media
Total Pages: 351
Release: 2005-12-17
Genre: Mathematics
ISBN: 0306476169

Many questions dealing with solvability, stability and solution methods for va- ational inequalities or equilibrium, optimization and complementarity problems lead to the analysis of certain (perturbed) equations. This often requires a - formulation of the initial model being under consideration. Due to the specific of the original problem, the resulting equation is usually either not differ- tiable (even if the data of the original model are smooth), or it does not satisfy the assumptions of the classical implicit function theorem. This phenomenon is the main reason why a considerable analytical inst- ment dealing with generalized equations (i.e., with finding zeros of multivalued mappings) and nonsmooth equations (i.e., the defining functions are not c- tinuously differentiable) has been developed during the last 20 years, and that under very different viewpoints and assumptions. In this theory, the classical hypotheses of convex analysis, in particular, monotonicity and convexity, have been weakened or dropped, and the scope of possible applications seems to be quite large. Briefly, this discipline is often called nonsmooth analysis, sometimes also variational analysis. Our book fits into this discipline, however, our main intention is to develop the analytical theory in close connection with the needs of applications in optimization and related subjects. Main Topics of the Book 1. Extended analysis of Lipschitz functions and their generalized derivatives, including ”Newton maps” and regularity of multivalued mappings. 2. Principle of successive approximation under metric regularity and its - plication to implicit functions.

Nonsmooth Optimization

Nonsmooth Optimization
Author: Claude Lemarechal
Publisher: Elsevier
Total Pages: 195
Release: 2014-05-19
Genre: Technology & Engineering
ISBN: 1483188760

Nonsmooth Optimization contains the proceedings of a workshop on non-smooth optimization (NSO) held from March 28 to April 8,1977 in Austria under the auspices of the International Institute for Applied Systems Analysis. The papers explore the techniques and theory of NSO and cover topics ranging from systems of inequalities to smooth approximation of non-smooth functions, as well as quadratic programming and line searches. Comprised of nine chapters, this volume begins with a survey of Soviet research on subgradient optimization carried out since 1962, followed by a discussion on rates of convergence in subgradient optimization. The reader is then introduced to the method of subgradient optimization in an abstract setting and the minimal hypotheses required to ensure convergence; NSO and nonlinear programming; and bundle methods in NSO. A feasible descent algorithm for linearly constrained least squares problems is described. The book also considers sufficient minimization of piecewise-linear univariate functions before concluding with a description of the method of parametric decomposition in mathematical programming. This monograph will be of interest to mathematicians and mathematics students.