Proximal algorithms /

This monograph is about a class of optimization algorithms called proximal algorithms. Much like Newton's method is a standard tool for solving unconstrained smooth optimization problems of modest size, proximal algorithms can be viewed as an analogous tool for nonsmooth, constrained, large-sca...

Full description

Bibliographic Details
Main Authors: Parikh, Neal (Author), Boyd, Stephen P (Author)
Format: Book
Language:English
Published: [Hanover, Massachusetts] : Now Publishers, 2014
Series:Foundations and trends in optimization ; volume 1, issue 3, pages 127-239
Subjects:

Internet

This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.

Stanford University

Holdings details from Stanford University
Call Number: INTERNET RESOURCE