Relaxation methods for problems with strictly convex separable costs and linear constraints
Bibliography: p. 25-26.
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 |
Similar Items
Similar Items
-
Relaxation methods for problems with strictly convex costs and linear inequality constraints
Published: (2003) -
Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
Published: (2003) -
An e-relaxation method for separable convex cost network flow problems
Published: (2003) -
E-relaxation and auction method for separable convex cost network flow problems
Published: (2003) -
An E-relaxation method for separable convex cost generalized network flow problems
Published: (2003)