Rounding of convex sets and efficient gradient methods for linear programming problems

Rounding of convex sets and efficient gradient methods for linear programming problems

0.00 Avg rating0 Votes
Article ID: iaor2009677
Country: United Kingdom
Volume: 23
Issue: 1
Start Page Number: 109
End Page Number: 128
Publication Date: Feb 2008
Journal: Optimization Methods & Software
Authors:
Keywords: programming: convex, sets
Abstract:

In this paper, we propose new efficient gradient schemes for two non-trivial classes of linear programming problems. These schemes are designed to compute approximate solutions with relative accuracy δ.

Reviews

Required fields are marked *. Your email address will not be published.