Classical and Modern Optimization(Advanced Textbooks in Mathematics)

经典优化与现代优化

运筹学

售   价:
537.00
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出  版 社
出版时间
2022年03月18日
装      帧
平装
ISBN
9781800610866
复制
页      码
388 pp
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存50本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The quest for the optimal is ubiquitous in nature and human behavior. The field of mathematical optimization has a long history and remains active today, particularly in the development of machine learning.Classical and Modern Optimization presents a self-contained overview of classical and modern ideas and methods in approaching optimization problems. The approach is rich and flexible enough to address smooth and non-smooth, convex and non-convex, finite or infinite-dimensional, static or dynamic situations. The first chapters of the book are devoted to the classical toolbox: topology and functional analysis, differential calculus, convex analysis and necessary conditions for differentiable constrained optimization. The remaining chapters are dedicated to more specialized topics and applications.Valuable to a wide audience, including students in mathematics, engineers, data scientists or economists, Classical and Modern Optimization contains more than 200 exercises to assist with self-study or for anyone teaching a third- or fourth-year optimization class.Key Features: oMost textbooks on optimization focus on a special type of problems. This book gives a self-contained overview (covering finite or infinite-dimensional, convex or nonconvex, smooth or non-smooth, static or dynamic problems, iterative methods ...)oThis self-contained book starts with a rigorous but flexible toolbox. It then develops more specialized topics and applications: problems depending on a parameter, dynamic programming in discrete and continuous time, calculus of variations, convex duality (including duality for linear and SD programming), optimal transport, iterative convex minimization methods, applications of optimization to data sciencesoThe book contains more than 200 exercises which may also make it useful to anyone teaching a third/fourth year optimization classoThe book contains some results which are important and useful but not easy to find in textbooks (e.g. generic uniqueness of extremizers, Ekeland’s local surjection theorem, a detailed treatment of first and second-order optimality conditions for constrained minimizers in Banach spaces, the so-called envelope theorem, the subdifferential of a supremum of convex functions, Birkhoff-von Neumann theorem, Nesterov’s accelerated gradient method, convergence of the Douglas-Rachford algorithm, sparse solutions of basis pursuit ...)
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个