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

Cover title.

Bibliographic Details
Other Authors: Tseng, Paul.
Language:eng
Published: Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] 2003
Subjects:
Online Access:http://hdl.handle.net/1721.1/3026
_version_ 1811083585252229120
author2 Tseng, Paul.
author_facet Tseng, Paul.
collection MIT
description Cover title.
first_indexed 2024-09-23T12:35:25Z
id mit-1721.1/3026
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T12:35:25Z
publishDate 2003
publisher Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]
record_format dspace
spelling mit-1721.1/30262019-04-10T13:39:11Z Relaxation methods for problems with strictly convex costs and linear inequality constraints Tseng, Paul. Bertsekas, Dimitri P. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. TK7855.M41 E3845 no.1717 Cover title. Includes bibliographical references. Supported by the National Science Foundation. NSF-ECS-8519058 Supported by the Army Research Office. DAAL03-86-K-0171 by Paul Tseng and Dimitri P. Bertsekas. 2003-04-29T15:29:44Z 2003-04-29T15:29:44Z 1987 http://hdl.handle.net/1721.1/3026 eng LIDS-P ; 1717 21 p. 951787 bytes application/pdf application/pdf Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]
spellingShingle TK7855.M41 E3845 no.1717
Relaxation methods for problems with strictly convex costs and linear inequality constraints
title Relaxation methods for problems with strictly convex costs and linear inequality constraints
title_full Relaxation methods for problems with strictly convex costs and linear inequality constraints
title_fullStr Relaxation methods for problems with strictly convex costs and linear inequality constraints
title_full_unstemmed Relaxation methods for problems with strictly convex costs and linear inequality constraints
title_short Relaxation methods for problems with strictly convex costs and linear inequality constraints
title_sort relaxation methods for problems with strictly convex costs and linear inequality constraints
topic TK7855.M41 E3845 no.1717
url http://hdl.handle.net/1721.1/3026