Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Comput Optim Appl

Search In Journal Title:

Abbravation: Computational Optimization and Applications

Search In Journal Abbravation:

Publisher

Kluwer Academic Publishers-Plenum Publishers

Search In Publisher:

DOI

10.1007/bf01448214

Search In DOI:

ISSN

1573-2894

Search In ISSN:
Search In Title Of Papers:

An interiorpoint approach for primal blockangula

Authors: Jordi Castro
Publish Date: 2007/02/21
Volume: 36, Issue: 2-3, Pages: 195-219
PDF Link

Abstract

Multicommodity flows belong to the class of primal blockangular problems An efficient interiorpoint method has already been developed for linear and quadratic network optimization problems It solved normal equations using sparse Cholesky factorizations for diagonal blocks and a preconditioned conjugate gradient for linking constraints In this work we extend this procedure showing that the preconditioner initially developed for multicommodity flows applies to any primal blockangular problem although its efficiency depends on each particular linking constraints structure We discuss the conditions under which the preconditioner is effective The procedure is implemented in a userfriendly package in the MATLAB environment Computational results are reported for four primal blockangular problems multicommodity flows nonoriented multicommodity flows minimumdistance controlled tabular adjustment for statistical data protection and the minimum congestion problem The results show that this procedure holds great potential for solving large primalblock angular problems efficiently

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A benchmark library and a comparison of heuristic methods for the linear ordering problem
  2. Compression and denoising using l 0 -norm
  3. AAR-based decomposition algorithm for non-linear convex optimisation
  4. Classification of companies using maximal margin ellipsoidal surfaces
  5. Multi-step nonlinear conjugate gradient methods for unconstrained minimization
  6. Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria
  7. Minimization of the Tikhonov functional in Banach spaces smooth and convex of power type by steepest descent in the dual
  8. Numerical experiments with an inexact Jacobian trust-region algorithm
  9. Computing the metric dimension of graphs by genetic algorithms
  10. Some non-interior path-following methods based on a scaled central path for linear complementarity problems
  11. On the resolution of certain discrete univariate max–min problems
  12. A coordinate gradient descent method for ℓ 1 -regularized convex minimization
Search Result: