Inertia-revealing preconditioning for large-scale nonconvex constrained optimization

SIAM Journal on Scientific Computing

Volumn 31, Issue 2, 2008, Pages 939-960

  Schenk, Olaf ^a   Wachter, Andreas ^b   Weiser, Martin ^c  

^a UNIVERSITY OF BASEL   (Switzerland)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Biomedical cancer application; Indefinite systems; Inertia; Interior point method; Multilevel preconditioning; Nonconvex constrained optimization; Optimal control

Indexed keywords

CONSTRAINED OPTIMIZATION; DISEASES; EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC METHODS; HYPERTHERMIA THERAPY; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; OPTIMAL CONTROL SYSTEMS;

BIOMEDICAL CANCER APPLICATION; INDEFINITE SYSTEMS; INERTIA; INTERIOR-POINT METHOD; LARGE-SCALES; MULTILEVEL PRECONDITIONING; NEWTON'S METHODS; NONCONVEX; NONCONVEX CONSTRAINED OPTIMIZATION; OPTIMAL CONTROLS;

NEWTON-RAPHSON METHOD;

EID: 67349213103     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/070707233     Document Type: Article

References (40)

1. J. I. ALIAGA, M. BQLLHÖFER, A.F. MARTÍN, AND E. S. QUINTANA-ORTI, Parallelization of multilevel preconditioners constructed from inverse-based ILUs on shared-memory multiprocessors, in Parallel Computing: Architectures, Algorithms and Applications, Vol. 38, C. Bischof, M. Biicker, P. Gibbon, G. R. Joubert, T. Lippert, B. Mohr, F. Peters, John von Neumann Institute for Computing, Jiilich, Germany, 2008, pp. 287-294.
2. A. E. BEATQN AND J. W. TUKEY, The fitting of power series, meaning polynomials, illustrated on band-spectroscopic data, Technometrics, 16 (1974), pp. 147-185.
3. H. Y. BENSON, AMPL formulation of CUTE models, http://www.sor.princeton.edu/~rvdb/ ampl/nlmodels/cute/.
4. M. BENZI, G. H. GQLUB, AND J. LLESEN, Numerical solution of saddle point problems,Acta Numer., 14 (2005), pp. 1-137.
5. G. BIROS AND O. GHATTAS, Parallel Lagrange-Newton-Krylov-Schur methods for PDE- constrained optimization, Part I: The Krylov-Schur solver, SIAMJ.Sci.Comput., 27 (2005), pp. 687-713.
6. G. BIROS AND O. GHATTAS, Parallel Lagrange-Newton-Krylov-Schur methods for PDE- constrained optimization, Part II: The Lagrange-Newton solver and its application to optimal control of steady viscous flows, SIAM J. Sci. Comput., 27 (2005), pp. 714-739.
7. M. BOLLHÖFER AND Y. SAAD, Multilevel preconditioners constructed from inverse-based ILUs, SIAM J. Sci. Comput., 27 (2006), pp. 1627-1650.
8. A. S. BONDARENKO, D. M. BORTZ, AND J. J. MORE, COPS: Large-Scale Nonlinearly Constrained Optimization Problems, Tech. report ANL/M CS-TM-237, Argonne National Laboratory, Argonne, IL, 1998.
9. I. BONGARTZ, A. R. CONN, N. I. M. GOULD, AND Ph. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
10. J. R. BUNCH, Partial pivoting strategies for symmetric matrices, SIAM J. Numer. Anal., 11 (1974), pp. 521-528.
11. J. R. BUNCH AND L. KAUFMAN, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comp., 31 (1977), pp. 1 63-179.
12. J. R. BUNCH, L. KAUFMAN, AND B. PARLETT, Decomposition of a symmetric matrix,Numer. Math., 27 (1976), pp. 95-109.
13. R. H. BYRD, F. E. CURTIS, AND J. NOCEDAL, An inexact Newton method for nonconvex equality constrained optimization, Math. Program., to appear.
14. R. H. BYRD, M. E. HRIBAR, AND J. NOCEDAL, An interior point algorithm for large-scale nonlinear programming, SIAM J. Optim., 9 (1999), pp. 877-900.
15. A. K. CLINE, C. B. MOLER, G. W. STEWART, AND J. H. WILKINSON, An estimate for the condition number of a matrix, SIAM J. Numer. Anal., 16 (1979), pp. 368-375.
16. P. DEUFLHARD, M. WEISER, AND M. SEEBASS, A new nonlinear elliptic multilevel FEM applied to regional hyperthermia, Comput. Vis. Sci., 3 (2000), pp. 115-120.
17. I. S. DUFF AND J. KOSTER, The design and use of algori thms for permuting large entries to the diagonal of sparse matrices, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 889-901.
18. I. S. DUFF AND J. KOSTER, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 973-996.
19. I. S. DUFF AND S. PRALET, Strategies for scaling and pivoting for sparse symmetric indefinite problems, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 313-340.
20. A. FORSGREN, Inertia-controlling factorizations for opti mization algorithms, Appl. Numer. Math., 43 (2002), pp. 91-107.
21. A. FORSGREN,P.E.GLLL, AND M. H. WRIGHT, Interior methods for nonlinear optimization, SIAM Rev., 44 (2002), pp. 525-597.
22. R. FOURER, D. M. GAY, AND B. W. KERNIGHAN, AMPL : A Modeling Language For Mathematical Programming, Thomson, Danvers, MA, 1993.
23. R. FREUND AND F. JARRE, A QMR-based interior-point algorithm for solving linear programs, Math. Programming, Ser. B, 76 (1997), pp. 183-210.
24. R. W. FREUND, Preconditioning of symmetric, but highly indefinite linear systems, in 15th IMACS World Congress on Scientific Computation, Modelling and Applied Mathematics, Vol. 2, Numerical Mathematics, Wissenschaft und Technik Verlag, Berlin, 1997, pp. 551- 556.
25. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
26. N. I. M. GOULD, On modified factorizations for large-scale linearly constrained optimization, SIAM J. Optim., 9 (1999), pp. 1041-1063.
27. N. I. M. GOULD, Y. HU, AND J. A. SCOTT, A numerical evaluation of sparse direct solvers for the solution of large sparse, symmetric linear systems of equations,ACMTrans.Math. Software, 33 (2007), article 10.
28. N. I. M. GOULD, D. ORBAN, AND P. L. TOINT, Numerical methods for large-scale nonlinear optimization, Acta Numer., 14 (2005), pp. 299-361.
29. E. HABER AND U. ASCHER, Preconditioned all-at-once methods for large, sparse parameter estimation problems, Inverse Problems, 17 (2001), pp. 1847-1864.
30. M. HAGEMANN AND O. SCHENK, Weighted matchings for preconditioning symmetric indefinite linear systems, SIAM J. Sci. Comput., 28 (2006), pp. 403-420.
31. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392.
32. H. MAURER AND H. D. MITTELMANN, Optimization techniques for solving elliptic control problems with control and state constraints. Part 1: Boundary control, Comput. Optim. Appl., 16 (2000), pp. 29-55.
33. D. RUIZ, I. S. DUFF, AND B. UCAR, Computing a class of bipartite matchings in parallel,talk at the SIAM Conference on Parallel Processing for Sc ientific Computing, 2008.
34. O. SCHENK, M. BQLLHÖFER, AND r. a. RÖMER, On large scale diagonalization techniques for the Anderson model of localization, SIAM Rev., 50 (2008), pp. 91-112.
35. O. SCHENK AND K. GÄRTNER, Solving unsymmetric sparse systems of linear equations with PARDISO, J. Future Generation Comput. Systems, 20 (2004), pp. 475-487.
36. O. SCHENK AND K. GARTNER, On fast factorization pivoting methods for symmetric indefinite systems, Electron Trans. Numer. Anal., 23 (2006), pp. 158-179.
37. o. SCHENK, a. WÄCHTER, AND m. HAGEMANN, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale no ncotvex interior-point optimization, Comput. Optim. Appl., 36 (2007), pp. 321-341.
38. R. J. VANDERBEI AND D. F. SHANNQ, An interior-point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl., 13 (1999), pp. 231-252.
39. A. WÄCHTER AND L. T. BIEGLER, On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming, Math. Program., 106 (2006), pp. 25-57.
40. r. a. WALTZ, j. l. mORALES, j. NQCEDAL, AND d. ORBAN, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Math. Program., 107 (2006), pp. 391-408.