Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A weighted projection centering method
Author: Moretti, AC
Abstract: 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 approach.
Subject: successive orthogonal projections
centers of polytopes
linear programming
Country: Brasil
Editor: Soc Brasileira Matematica Aplicada & Computacional
Rights: aberto
Date Issue: 2003
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000208134700002.pdf228.27 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.