Convex Optimization Algorithms

Dimitri Bertsekas

This book provides a comprehensive and accessible presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of visualization where possible. This is facilitated by the extensive use of analytical and algorithmic concepts of duality, which by nature lend themselves to geometrical interpretation.

جهت استعلام قيمت و سفارش چاپ اين محصول لطفا با انتشارات گنج حضور تماس حاصل فرماييد.