Relaxation methods for problems with strictly convex...

Mathematical Programming 1987 Vol. 38; Iss. 3

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

Paul Tseng, Dimitri P. Bertsekas
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
38
Year:
1987
Language:
english
Pages:
19
Journal:
Mathematical Programming
DOI:
10.1007/bf02592017
File:
PDF, 734 KB
english, 1987
Conversion to is in progress
Conversion to is failed