IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/2003059.html
   My bibliography  Save this paper

Gaussian elimination as a computational paradigm

Author

Listed:
  • LOUTE, Etienne

Abstract

An abstract view of symmetric gaussian elimination is presented. Problems are viewed as an assembly of computational entities whose interdependence is modeled by a graph. An algorithmic transformation on the entities which can be associated withvertex removal, is assumed to exist. The elimination tree of the symmetric gaussian elimination figures the order in which these transformations are applied and captures any potential parallelism. The inherently sequential part of the computational effort depends on the height of the tree. The paradigm is illustrated by block structured LP problems with nested decomposition and basis factorization approaches, problems of blocked symmetric and unsymmetric systems of linear equations, with espectively blocked Cholesky factorization and blocked gaussian elimination. Contributions are: demonstration of the paradigm expressive power through graph concepts (eliminations sets, elimination chains, etc.); emphasis on patterns of similarity in the use of the graph concepts and finally an effective parallelization tool for blocked Cholesky factorization of matrices arising in time phased or dynamic LP models solved by interior point algorithms.

Suggested Citation

  • LOUTE, Etienne, 2003. "Gaussian elimination as a computational paradigm," LIDAM Discussion Papers CORE 2003059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvco:2003059
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp2003.html
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. HO, James K. & LOUTE, Etienne, 1981. "An advanded implementation of the Dantzig-Wolfe decomposition algorithm for linear programming," LIDAM Reprints CORE 513, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Harry M. Markowitz, 1957. "The Elimination form of the Inverse and its Application to Linear Programming," Management Science, INFORMS, vol. 3(3), pages 255-269, April.
    3. Arthur M. Geoffrion, 1970. "Elements of Large Scale Mathematical Programming Part II: Synthesis of Algorithms and Bibliography," Management Science, INFORMS, vol. 16(11), pages 676-691, July.
    4. John R. Birge, 1985. "Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs," Operations Research, INFORMS, vol. 33(5), pages 989-1007, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    2. Xiang Li & Asgeir Tomasgard & Paul I. Barton, 2011. "Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 425-454, December.
    3. Xiang Li & Asgeir Tomasgard & Paul Barton, 2012. "Decomposition strategy for the stochastic pooling problem," Journal of Global Optimization, Springer, vol. 54(4), pages 765-790, December.
    4. de Queiroz, Anderson Rodrigo, 2016. "Stochastic hydro-thermal scheduling optimization: An overview," Renewable and Sustainable Energy Reviews, Elsevier, vol. 62(C), pages 382-395.
    5. Sandeep Rath & Kumar Rajaram, 2022. "Staff Planning for Hospitals with Implicit Cost Estimation and Stochastic Optimization," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1271-1289, March.
    6. Castro, Jordi & Escudero, Laureano F. & Monge, Juan F., 2023. "On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach," European Journal of Operational Research, Elsevier, vol. 310(1), pages 268-285.
    7. Guigues, Vincent & Juditsky, Anatoli & Nemirovski, Arkadi, 2021. "Constant Depth Decision Rules for multistage optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 223-232.
    8. Ketabchi, Saeed & Behboodi-Kahoo, Malihe, 2015. "Augmented Lagrangian method within L-shaped method for stochastic linear programs," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 12-20.
    9. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    10. Harry M. Markowitz, 2004. "Trains of Thought," Chapters, in: Michael Szenberg & Lall Ramrattan (ed.), Reflections of Eminent Economists, chapter 17, Edward Elgar Publishing.
    11. Gyana R. Parija & Shabbir Ahmed & Alan J. King, 2004. "On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 73-83, February.
    12. Kai Huang & Shabbir Ahmed, 2009. "The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty," Operations Research, INFORMS, vol. 57(4), pages 893-904, August.
    13. Marco Colombo & Andreas Grothey, 2013. "A decomposition-based crash-start for stochastic programming," Computational Optimization and Applications, Springer, vol. 55(2), pages 311-340, June.
    14. J. Gondzio, 1994. "Preconditioned Conjugate Gradients in an Interior Point Method for Two-stage Stochastic Programming," Working Papers wp94130, International Institute for Applied Systems Analysis.
    15. Defeng Liu & Andrea Lodi & Mathieu Tanneau, 2021. "Learning chordal extensions," Journal of Global Optimization, Springer, vol. 81(1), pages 3-22, September.
    16. A. Ruszczynski, 1994. "On Augmented Lagrangian Decomposition Methods For Multistage Stochastic Programs," Working Papers wp94005, International Institute for Applied Systems Analysis.
    17. Peter Kall & János Mayer, 2006. "Some insights into the solution algorithms for SLP problems," Annals of Operations Research, Springer, vol. 142(1), pages 147-164, February.
    18. Diana Barro & Elio Canestrelli, 2011. "Combining stochastic programming and optimal control to solve multistage stochastic optimization problems," Working Papers 2011_24, Department of Economics, University of Venice "Ca' Foscari", revised 2011.
    19. Entriken, Robert & Infanger, Gerd, 1990. "5.2 Decomposition and importance sampling for stochastic linear models," Energy, Elsevier, vol. 15(7), pages 645-659.
    20. L. F. Escudero & J. F. Monge & D. Romero Morales & J. Wang, 2013. "Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management," Transportation Science, INFORMS, vol. 47(2), pages 181-197, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2003059. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.