Convex Optimization: Introductory Course

✍ Scribed by Mikhail Moklyachuk

Publisher: Wiley-ISTE
Year: 2021
Tongue: English
Leaves: 254
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

This book provides easy access to the basic principles and methods for solving constrained and unconstrained convex optimization problems. Included are sections that cover: basic methods for solving constrained and unconstrained optimization problems with differentiable objective functions; convex sets and their properties; convex functions and their properties and generalizations; and basic principles of sub-differential calculus and convex programming problems. Convex Optimization provides detailed proofs for most of the results presented in the book and also includes many figures and exercises for a better understanding of the material. Exercises are given at the end of each chapter, with solutions and hints to selected exercises given at the end of the book. Undergraduate and graduate students, researchers in different disciplines, as well as practitioners will all benefit from this accessible approach to convex optimization methods.

📜 SIMILAR VOLUMES

Introductory Lectures on Convex Optimiza

📁 Introductory Lectures on Convex Optimization: A Basic Course

✍ Yurii Nesterov (auth.) 📂 Library 📅 2004 🏛 Springer US 🌐 English

<p>It was in the middle of the 1980s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear op timization problems, was not only in its complexity bound. At that time, the most surprisi

Introductory Lectures on Convex Optimiza

📁 Introductory Lectures on Convex Optimization: A Basic Course

✍ Y. Nesterov 📂 Library 📅 2003 🏛 Springer 🌐 English

Introductory Lectures on Convex Optimiza

📁 Introductory Lectures on Convex Optimization: A Basic Course

✍ Y. Nesterov 📂 Library 📅 2003 🏛 Springer 🌐 English

Nesterov (Center of Operations Research and Econometrics, Universitè Catholique de Louvain, Belgium) explains the main ideas of complexity theory for convex optimization, covering optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. A separate chapter is devoted

Fundamentals of Optics: An Introductory

📁 Fundamentals of Optics: An Introductory Course

✍ Yobani Mejía-Barbosa 📂 Library 📅 2023 🏛 SPIE 🌐 English

<span>This book presents a simple yet elegant introduction to classical optics focused primarily on establishing fundamental concepts for students new to the field. With examples demonstrating the use of optics in a wide range of practical applications, it reflects the pedagogical approach used by P

Introductory Lectures on Convex Programm

📁 Introductory Lectures on Convex Programming Volume I: Basic course

✍ Nesterov Yu. 📂 Library 🌐 English

Boston, Kluwer, 2004, 212с.<div class="bb-sep"></div>Nonlinear Programming.<br/> The World of Nonlinear Optimization.<br/> Local methods in unconstrained minimization.<br/> First-order methods in nonlinear optimization.<br/>Smooth Convex Programming.<br/> Minimization of Smooth Functions.<br/> Optim

Convex Optimization

📁 Convex Optimization

✍ Stephen Boyd, Lieven Vandenberghe 📂 Library 📅 2004 🏛 Cambridge University Press 🌐 English