Relaxation methods for problems with strictly convex separable costs and linear constraints

Bibliography: p. 25-26.

Bibliographic Details
Other Authors: Tseng, Paul.
Language:eng
Published: Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
Subjects:
Online Access:http://hdl.handle.net/1721.1/2936
_version_ 1826215625058418688
author2 Tseng, Paul.
author_facet Tseng, Paul.
collection MIT
description Bibliography: p. 25-26.
first_indexed 2024-09-23T16:36:52Z
id mit-1721.1/2936
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T16:36:52Z
publishDate 2003
publisher Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
record_format dspace
spelling mit-1721.1/29362019-04-10T12:41:30Z Relaxation methods for problems with strictly convex separable costs and linear constraints Tseng, Paul. Bertsekas, Dimitri P. TK7855.M41 E3845 no.1567 Bibliography: p. 25-26. National Science Foundation grant NSF-ECS-3217668 by Paul Tseng, Dimitri P. Bertsekas. 2003-04-29T15:27:03Z 2003-04-29T15:27:03Z 1986 http://hdl.handle.net/1721.1/2936 eng LIDS-P ; 1567 26 p. 1142928 bytes application/pdf application/pdf Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
spellingShingle TK7855.M41 E3845 no.1567
Relaxation methods for problems with strictly convex separable costs and linear constraints
title Relaxation methods for problems with strictly convex separable costs and linear constraints
title_full Relaxation methods for problems with strictly convex separable costs and linear constraints
title_fullStr Relaxation methods for problems with strictly convex separable costs and linear constraints
title_full_unstemmed Relaxation methods for problems with strictly convex separable costs and linear constraints
title_short Relaxation methods for problems with strictly convex separable costs and linear constraints
title_sort relaxation methods for problems with strictly convex separable costs and linear constraints
topic TK7855.M41 E3845 no.1567
url http://hdl.handle.net/1721.1/2936