Influence Of Matrix Reordering On The Performance Of Iterative Methods For Solving Linear Systems Arising From Interior Point Methods For Linear Programming

dc.creatorSilva
dc.creatorDaniele; Velazco
dc.creatorMarta; Oliveira
dc.creatorAurelio
dc.date2017
dc.datefev
dc.date2017-11-13T13:24:16Z
dc.date2017-11-13T13:24:16Z
dc.date.accessioned2018-03-29T05:56:47Z
dc.date.available2018-03-29T05:56:47Z
dc.identifierMathematical Methods Of Operations Research. Springer Heidelberg, v. 85, p. 97 - 112, 2017.
dc.identifier1432-2994
dc.identifier1432-5217
dc.identifierWOS:000397237500007
dc.identifier10.1007/s00186-017-0571-7
dc.identifierhttps://link-springer-com.ez88.periodicos.capes.gov.br/article/10.1007%2Fs00186-017-0571-7
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/328265
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1365290
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionThis study analyzes the influence of sparse matrix reordering on the solution of linear systems arising from interior point methods for linear programming. In particular, such linear systems are solved by the conjugate gradient method with a two-phase hybrid preconditioner that uses the controlled Cholesky factorization during the initial iterations and later adopts the splitting preconditioner. This approach yields satisfactory computational results for the solution of linear systems with symmetric positive-definite matrices. Three reordering heuristics are analyzed in this study: the reverse Cuthill-McKee heuristic, the Sloan algorithm, and the minimum degree heuristic. Through numerical experiments, it was observed that these heuristics can be advantageous in terms of accelerating the convergence of the conjugate gradient method and reducing the processing time.
dc.description85
dc.description1
dc.description97
dc.description112
dc.descriptionResearch of the State of Sao Paulo (FAPESP) and the Brazilian Council
dc.descriptionDevelopment of Science and Technology (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.description13th EUROPT Workshop on Advances in Continuous Optimization
dc.descriptionJUL 08-10, 2015
dc.descriptionEdinburgh, SCOTLAND
dc.description
dc.languageEnglish
dc.publisherSpringer Heidelberg
dc.publisherHeidelberg
dc.relationMathematical Methods of Operations Research
dc.rightsfechado
dc.sourceWOS
dc.subjectInterior Point Methods
dc.subjectLinear Systems
dc.subjectIterative Methods
dc.subjectPreconditioner
dc.subjectReordering Heuristics
dc.titleInfluence Of Matrix Reordering On The Performance Of Iterative Methods For Solving Linear Systems Arising From Interior Point Methods For Linear Programming
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución