Dynamic Factorization in Large-Scale Optimization
Brown, Gerald G.
MetadataShow full item record
Factorization of linear programming (LP) models enables a large portion of the LP tableau to be represented implicitly and generated from the remaining explicit part. Dynamic factorization admits algebraic elements which change in dimension during the course of solution. A unifying mathematical framework for dynamic row factorization is presented with three algorithms which derive from different LP model row structures: generalized upper bound rows, pure network rows,and generalized network TOWS. Each of these structures is a generalization of its predecessors, and each corresponding algorithm exhibits just enough additional richness to accommodate the structure at hand within the unified framework. Implementation and computational results are presented for a variety of real-world models. These results suggest that each of these algorithms is superior to the traditional, non-factorized approach, with the degree of improvement depending upon the size and quality of the row factorization identified.
Mathematical Programming, 64, pp. 17-51.
Showing items related by title, author, creator and subject.
Raptis, Grigorios J. (Monterey, California. Naval Postgraduate School, 1991-09);Three numerical procedures are presented for updating regressions. All three methods are based on QR factorization, but after that they use different philosophies to update the regression coefficients. Elden's algorithm ...
Ferreira Filho, Milton Pinto (Monterey, California. Naval Postgraduate School, 1992-09);Subspace decomposition methods are a very useful technique to extract the signal information via Eigen-based estimators. Although these techniques are very accurate, they are usually expensive to update, becoming difficult ...
Maitra, Submahoy; Subba Rao, Y. V.; Stanica, Pantelimon; Gangopadhyay, Sugata (2009);In this paper we discuss the problem of finding nontrivial solutions to the Cubic Sieve Congruence probem, that is, solutions of x2 = y2z (mod p), where x,y,z < p1/2 and x3 = y2z. The solutions to this problem are useful ...