Add to ORKGAbstract. An iterative method for finding the center of a linear programming polytope is presented. The method assumes that we start at a feasible interior point and each iterate is obtained as a convex combination of the orthogonal projection on the half spaces defined by the linear inequalities plus a special projections on the same half spaces. The algorithm is particularly suitable for implementation on computers with parallel processors. We show some examples in two dimensional space to describe geometrically how the method works. Finally, we present computational results on random generated polytopes and linear programming polytopes from NetLib to compare the centering quality of the center using projections and the analytic center ap...
AbstractSmale proposed a framework for applying Newton's method to the linear programming problem. I...
150 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.We present four algorithms th...
Abstract. We present a target-following framework for semidefinite programming, which generalizes th...
An iterative method for finding the center of a linear programming polytope is presented. The method...
The main ingredient for polynomiality in interior point methods is the centering procedure. All inte...
In the paper of Liao and Todd [3] two weighted centers are introduced and used to design algorithms ...
Abstract. The feasibility problem for a system of linear inequalities can be converted into an uncon...
. The feasibility problem for a system of linear inequalities can be converted into an unconstrained...
The feasibility problem for a system of linear inequalities can be converted into an unconstrained o...
The analytic center o of an n-dimensional polytope P = {x E R": aTx- b, 2 0 (i = 1.2,...,m)...
The notion of weighted centers is essential in V-space interior-point algorithms for linear programm...
The purpose of this study is to broaden the scope of projective transformation methods in mathematic...
The center of area of a convex planar set X is the point p for which the minimum area of X intersect...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
AbstractAn iterative algorithm is developed for the problem of finding the projection of a point on ...
AbstractSmale proposed a framework for applying Newton's method to the linear programming problem. I...
150 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.We present four algorithms th...
Abstract. We present a target-following framework for semidefinite programming, which generalizes th...
An iterative method for finding the center of a linear programming polytope is presented. The method...
The main ingredient for polynomiality in interior point methods is the centering procedure. All inte...
In the paper of Liao and Todd [3] two weighted centers are introduced and used to design algorithms ...
Abstract. The feasibility problem for a system of linear inequalities can be converted into an uncon...
. The feasibility problem for a system of linear inequalities can be converted into an unconstrained...
The feasibility problem for a system of linear inequalities can be converted into an unconstrained o...
The analytic center o of an n-dimensional polytope P = {x E R": aTx- b, 2 0 (i = 1.2,...,m)...
The notion of weighted centers is essential in V-space interior-point algorithms for linear programm...
The purpose of this study is to broaden the scope of projective transformation methods in mathematic...
The center of area of a convex planar set X is the point p for which the minimum area of X intersect...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
AbstractAn iterative algorithm is developed for the problem of finding the projection of a point on ...
AbstractSmale proposed a framework for applying Newton's method to the linear programming problem. I...
150 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.We present four algorithms th...
Abstract. We present a target-following framework for semidefinite programming, which generalizes th...