A weighted projection centering method
AUTOR(ES)
Moretti, Antonio Carlos
FONTE
Computational & Applied Mathematics
DATA DE PUBLICAÇÃO
2003
RESUMO
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.
Documentos Relacionados
- Predicting Protein Cellular Localization Using a Domain Projection Method
- A Weighted Mean Method of Averaging Bacterial Counts of Milk
- The Equivalent Linearization Method with a Weighted Averaging for Analyzing of Nonlinear Vibrating Systems
- Cartografia de um corpo em cena: extração e codificação de matrizes corporais através do método Body Mind Centering
- A PROJECTION SCOTOMETER