Partial proximal minimization algorithms for convex programming
Citable URI:
http://hdl.handle.net/1721.1/3313
| Title: | Partial proximal minimization algorithms for convex programming |
| Author: | Bertsekas, Dimitri P.; Tseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| Issue Date: | 1993 |
| Description: |
Caption title. Includes bibliographical references (p. 25-27). |
| URI: | http://hdl.handle.net/1721.1/3313 |
| Series/Report no.: | LIDS-P ; 2173 |
| Keywords: | TK7855.M41 E3845 no.2173 |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| P-2173-28187081.pdf | 1.628Mb |
View/ |
This item appears in the following Collection(s)
-
LIDS Technical Reports
The Laboratory for Information and Decision Systems Technical Report Series
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|