Convex Optimization: Algorithms and Complexity
by Sebastien Bubeck
Publisher: arXiv.org 2015
Number of pages: 130
This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural optimization and stochastic optimization.
Home page url
Download or read it online for free here:
by John Cea - Tata Institute of Fundamental Research
Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals; Minimization Without Constraints; Minimization with Constraints; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.
by Marius Durea, Radu Strugariu - De Gruyter Open
Starting with the case of differentiable data and the classical results on constrained optimization problems, continuing with the topic of nonsmooth objects involved in optimization, the book concentrates on both theoretical and practical aspects.
by Ozgur Baskan (ed.) - InTech
This book covers state-of-the-art optimization methods and their applications in wide range especially for researchers and practitioners who wish to improve their knowledge in this field. It covers applications in engineering and various other areas.
by Katta G. Murty
This book provides an in-depth and clear treatment of all the important practical, technical, computational, geometric, and mathematical aspects of the Linear Complementarity Problem, Quadratic Programming, and their various applications.