Affordable Access

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

  • Computer Science
  • Design


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 withrelative accuracy . We prove that the upper complexity bound for both ln schemes is O( n m ln n) iterations of a gradient-type method, where n and m, (n

There are no comments yet on this publication. Be the first to share your thoughts.