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

  • Authors:
  • Paul Tseng;Dimitri P. Bertsekas

  • Affiliations:
  • Massachusetts Institute of Technology, Cambridge;Massachusetts Institute of Technology, Cambridge

  • Venue:
  • Mathematical Programming: Series A and B
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract