登入選單
返回Google圖書搜尋
Convex Analysis and Variational Problems
Ivar EkelandRoger Temam
出版SIAM, 1999-12-01
主題Mathematics / Linear & Nonlinear ProgrammingMathematics / GeneralMathematics / CalculusMathematics / Vector AnalysisMathematics / Numerical Analysis
ISBN161197108X9781611971088
URLhttp://books.google.com.hk/books?id=OD7nXNEptZcC&hl=&source=gbs_api
EBookSAMPLE
註釋This book contains different developments of infinite dimensional convex programming in the context of convex analysis, including duality, minmax and Lagrangians, and convexification of nonconvex optimization problems in the calculus of variations (infinite dimension). It also includes the theory of convex duality applied to partial differential equations; no other reference presents this in a systematic way. The minmax theorems contained in this book have many useful applications, in particular the robust control of partial differential equations in finite time horizon. First published in English in 1976, this SIAM Classics in Applied Mathematics edition contains the original text along with a new preface and some additional references.