Affordable Access

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

Authors
Disciplines
  • Computer Science
  • Design

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 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.

Statistics

Seen <100 times
0 Comments

More articles like this

Approximate methods for solving problems of convex...

on USSR Computational Mathematics... Jan 01, 1977

Methods of solving systems of convex programming p...

on USSR Computational Mathematics... Jan 01, 1987

An efficient search direction for linear programmi...

on Computers & Operations Researc... Jan 01, 2002

The relaxation method of finding the common point...

on USSR Computational Mathematics... Jan 01, 1967
More articles like this..