Pasar al contenido principal

OPTIMIZACION DE PROBLEMAS ESTRUCTURADOS DE GRAN ESCALA. APLICACIONES A CONFIDENCIALIDAD DE DATOS.

MTM2012-31440

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2012
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 1
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Estudio, informe, memoria (Report)

On geometrical properties of preconditioners in IPMs for classes of block-angular problems

  • Castro Pérez, Jordi|||0000-0003-3573-4568
  • Nasini, Stefano
J. Castro, S. Nasini, On geometrical properties of preconditioners in IPMs for classes of block-angular problems, Research Report DR 2016/03, Dept. of Statistics and Operations Research, Universitat Politècnica de Catalunya, 2016., One of the most efficient interior-point methods for some classes of block-angular structured problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. In this work we show that the choice of a good preconditioner depends on geometrical properties of the constraints structure. In particular, it is seen that the principal angles between the subspaces generated by the diagonal blocks and the linking constraints can be used to estimate ex-ante the efficiency of the preconditioner. Numerical validation is provided with some generated optimization problems. An application to the solution of multicommodity network flow problems with nodal capacities and equal flows of up to 127 million of variables and up to 7.5 million of constraints is also presented