메뉴 건너뛰기




Volumn 32, Issue 1, 2010, Pages 249-270

Preconditioning saddle-point systems with applications in optimization

Author keywords

Iterative solver; Optimization; Preconditioning; Saddle point problems

Indexed keywords

CONJUGATE GRADIENT METHOD;

EID: 77249106506     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/080727129     Document Type: Conference Paper
Times cited : (29)

References (36)
  • 2
    • 0142038248 scopus 로고    scopus 로고
    • The role of the inner product in stopping criteria for conjugate gradient iterations
    • S. F. ASHBY, M. J. HOLST, T. A. MANTEUFFEL, AND P. E. SAYLOR, The role of the inner product in stopping criteria for conjugate gradient iterations, BIT, 41 (2001), pp. 26-52.
    • (2001) BIT , vol.41 , pp. 26-52
    • Ashby, S.F.1    Holst, M.J.2    Manteuffel, T.A.3    Saylor, P.E.4
  • 3
    • 20044390432 scopus 로고    scopus 로고
    • Numerical solution of saddle point problems
    • M. BENZI, G. H. GOLUB, AND J. LIESEN, Numerical solution of saddle point problems, Acta Numer., 14 (2005), pp. 1-137.
    • (2005) Acta Numer. , vol.14 , pp. 1-137
    • Benzi, M.1    Golub, G.H.2    Liesen, J.3
  • 4
    • 33645533824 scopus 로고    scopus 로고
    • On the eigenvalues of a class of saddle point matrices
    • M. BENZI AND V. SIMONCINI, On the eigenvalues of a class of saddle point matrices, Numer. Math., 103 (2006), pp. 173-196.
    • (2006) Numer. Math. , vol.103 , pp. 173-196
    • Benzi, M.1    Simoncini, V.2
  • 5
    • 84966214346 scopus 로고
    • A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems
    • J. H. BRAMBLE AND J. E. PASCIAK, A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems, Math. Comp., 50 (1988), pp. 1-17.
    • (1988) Math. Comp. , vol.50 , pp. 1-17
    • Bramble, J.H.1    Pasciak, J.E.2
  • 6
    • 0039991939 scopus 로고    scopus 로고
    • A modified Cholesky algorithm based on a symmetric indefinite factorization
    • S. H. CHENG AND N. J. HIGHAM, A modified Cholesky algorithm based on a symmetric indefinite factorization, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 1097-1110.
    • (1998) SIAM J. Matrix Anal. Appl. , vol.19 , pp. 1097-1110
    • Cheng, S.H.1    Higham, N.J.2
  • 7
    • 34547488514 scopus 로고    scopus 로고
    • Algorithm 886: IFISS, a Matlab toolbox for modelling incompressible flow
    • Art. 14.
    • H. C. ELMAN, A. RAMAGE, AND D. J. SILVESTER, Algorithm 886: IFISS, a Matlab toolbox for modelling incompressible flow, ACM Trans. Math. Software, 33 (2007), Art. 14.
    • (2007) ACM Trans. Math. Software , vol.33
    • Elman, H.C.1    Ramage, A.2    Silvester, D.J.3
  • 8
    • 33646374284 scopus 로고    scopus 로고
    • Finite elements and fast iterative solvers: With applications in incompressible fluid dynamics
    • Oxford University Press, New York
    • H. C. ELMAN, D. J. SILVESTER, AND A. J. WATHEN, Finite Elements and Fast Iterative Solvers: With Applications in Incompressible Fluid Dynamics, Numer. Math. Sci. Comput., Oxford University Press, New York, 2005.
    • (2005) Numer. Math. Sci. Comput.
    • Elman, H.C.1    Silvester, D.J.2    Wathen, A.J.3
  • 9
    • 45149115103 scopus 로고    scopus 로고
    • Modified Cholesky algorithms: A catalog with new approaches
    • H. FANG AND D. O'LEARY, Modified Cholesky algorithms: A catalog with new approaches, Math. Program. Ser. A, 115 (2008), pp. 319-349.
    • (2008) Math. Program. Ser. A , vol.115 , pp. 319-349
    • Fang, H.1    O'Leary, D.2
  • 10
    • 0000382130 scopus 로고    scopus 로고
    • Minimum residual methods for augmented systems
    • B. FISCHER, A. RAMAGE, D. J. SILVESTER, AND A. J. WATHEN, Minimum residual methods for augmented systems, BIT, 38 (1998), pp. 527-543.
    • (1998) BIT , vol.38 , pp. 527-543
    • Fischer, B.1    Ramage, A.2    Silvester, D.J.3    Wathen, A.J.4
  • 11
    • 44649161910 scopus 로고    scopus 로고
    • Iterative solution of augmented systems arising in interior methods
    • A. FORSGREN, P.E.GILL, AND J. D. GRIFFIN, Iterative solution of augmented systems arising in interior methods, SIAM J. Optim., 18 (2007), pp. 666-690.
    • (2007) SIAM J. Optim. , vol.18 , pp. 666-690
    • Forsgren, A.1    Gill, P.E.2    Griffin, J.D.3
  • 12
    • 0007702899 scopus 로고
    • Transpose-free quasi-minimal residual methods for non-Hermitian linear systems
    • Springer, New York
    • R. W. FREUND, Transpose-free quasi-minimal residual methods for non-Hermitian linear systems, in Recent Advances in Iterative Methods, IMA Vol. Math. Appl. 60, Springer, New York, 1994, pp. 69-94.
    • (1994) Recent Advances in Iterative Methods, IMA Vol. Math. Appl. , vol.60 , pp. 69-94
    • Freund, R.W.1
  • 13
    • 0016357685 scopus 로고
    • Newton-type methods for unconstrained and linearly constrained optimization
    • P. E. GILL AND W. MURRAY, Newton-type methods for unconstrained and linearly constrained optimization, Math. Programming, 7 (1974), pp. 311-350.
    • (1974) Math. Programming , vol.7 , pp. 311-350
    • Gill, P.E.1    Murray, W.2
  • 14
    • 0004240547 scopus 로고
    • Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London-New York
    • P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London-New York, 1981.
    • (1981) Practical Optimization
    • Gill, P.E.1    Murray, W.2    Wright, M.H.3
  • 15
    • 0004236492 scopus 로고    scopus 로고
    • 3rd ed., Johns Hopkins Stud. Math. Sci., Johns Hopkins University Press, Baltimore, MD
    • G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins Stud. Math. Sci., Johns Hopkins University Press, Baltimore, MD, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Van Loan, C.F.2
  • 16
    • 2442598318 scopus 로고    scopus 로고
    • CUTEr and SifDec: A constrained and unconstrained testing environment, revisited
    • N. GOULD, D. ORBAN, AND P. TOINT, CUTEr and SifDec: A constrained and unconstrained testing environment, revisited, ACM Trans. Math. Software, 29 (2003), pp. 373-394.
    • (2003) ACM Trans. Math. Software , vol.29 , pp. 373-394
    • Gould, N.1    Orban, D.2    Toint, P.3
  • 19
    • 0001087725 scopus 로고
    • On the accurate determination of search directions for simple differentiable penalty functions
    • N. I. M. GOULD, On the accurate determination of search directions for simple differentiable penalty functions, IMA J. Numer. Anal., 6 (1986), pp. 357-372.
    • (1986) IMA J. Numer. Anal. , vol.6 , pp. 357-372
    • Gould, N.I.M.1
  • 20
    • 0027540732 scopus 로고
    • Changing the norm in conjugate gradient type algorithms
    • M. H. GUTKNECHT, Changing the norm in conjugate gradient type algorithms,SIAM J. Numer. Anal., 30 (1993), pp. 40-56.
    • (1993) SIAM J. Numer. Anal. , vol.30 , pp. 40-56
    • Gutknecht, M.H.1
  • 21
    • 0034145598 scopus 로고    scopus 로고
    • Constraint preconditioning for indefinite linear systems
    • C. KELLER, N. I. M. GOULD, AND A. J. WATHEN, Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1300-1317.
    • (2000) SIAM J. Matrix Anal. Appl. , vol.21 , pp. 1300-1317
    • Keller, C.1    Gould, N.I.M.2    Wathen, A.J.3
  • 22
    • 11744250187 scopus 로고    scopus 로고
    • Block-triangular preconditioners for saddle point problems with a penalty term
    • PII S1064827596303624
    • A. KLAWONN, Block-triangular preconditioners for saddle point problems with a penalty term, SIAM J. Sci. Comput., 19 (1998), pp. 172-184. (Pubitemid 128617506)
    • (1998) SIAM Journal of Scientific Computing , vol.19 , Issue.1 , pp. 172-184
    • Klawonn, A.1
  • 23
    • 38549181681 scopus 로고    scopus 로고
    • On nonsymmetric saddle point matrices that allow conjugate gradient iterations
    • J. LIESEN AND B. N. PARLETT, On nonsymmetric saddle point matrices that allow conjugate gradient iterations, Numer. Math., 108 (2008), pp. 605-624.
    • (2008) Numer. Math. , vol.108 , pp. 605-624
    • Liesen, J.1    Parlett, B.N.2
  • 25
    • 0034497397 scopus 로고    scopus 로고
    • A note on preconditioning for indefinite linear systems
    • M. F. MURPHY, G. H. GOLUB, AND A. J. WATHEN, A note on preconditioning for indefinite linear systems, SIAM J. Sci. Comput., 21 (2000), pp. 1969-1972.
    • (2000) SIAM J. Sci. Comput. , vol.21 , pp. 1969-1972
    • Murphy, M.F.1    Golub, G.H.2    Wathen, A.J.3
  • 26
    • 0016555955 scopus 로고
    • Solutions of sparse indefinite systems of linear equations
    • C. C. PAIGE AND M. A. SAUNDERS, Solutions of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
    • (1975) SIAM J. Numer. Anal. , vol.12 , pp. 617-629
    • Paige, C.C.1    Saunders, M.A.2
  • 27
    • 0344950439 scopus 로고    scopus 로고
    • Krylov subspace methods for saddle point problems with indefinite preconditioning
    • M. ROZLOŽNÍK AND V. SIMONCINI, Krylov subspace methods for saddle point problems with indefinite preconditioning, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 368-391.
    • (2002) SIAM J. Matrix Anal. Appl. , vol.24 , pp. 368-391
    • Rozložník, M.1    Simoncini, V.2
  • 28
    • 24144467633 scopus 로고    scopus 로고
    • Iterative methods for sparse linear systems
    • Philadelphia
    • Y. SAAD, Iterative Methods for Sparse Linear Systems, SIAM, Philadelphia, 2003.
    • (2003) SIAM
    • Saad, Y.1
  • 29
    • 0039169750 scopus 로고    scopus 로고
    • Cholesky-based methods for sparse least squares: The benefits of regularization
    • Loyce Adams and J. L. Lazareth, eds., SIAM, Philadelphia
    • M. A. SAUNDERS, Cholesky-based methods for sparse least squares: The benefits of regularization, in Linear and Nonlinear Conjugate Gradient-Related Methods (Seattle, WA, 1995), Loyce Adams and J. L. Lazareth, eds., SIAM, Philadelphia, 1996, pp. 92-100.
    • (1996) Linear and Nonlinear Conjugate Gradient-Related Methods (Seattle, WA, 1995) , pp. 92-100
    • Saunders, M.A.1
  • 30
  • 31
    • 0033444962 scopus 로고    scopus 로고
    • A revised modified Cholesky factorization algorithm
    • R. B. SCHNABEL AND E. ESKOW, A revised modified Cholesky factorization algorithm, SIAM J. Optim., 9 (1999), pp. 1135-1148.
    • (1999) SIAM J. Optim. , vol.9 , pp. 1135-1148
    • Schnabel, R.B.1    Eskow, E.2
  • 32
    • 48249114388 scopus 로고    scopus 로고
    • Symmetric indefinite preconditioners for saddle point problems with applications to PDE-constrained optimization problems
    • J. SCHÖBERL AND W. ZULEHNER, Symmetric indefinite preconditioners for saddle point problems with applications to PDE-constrained optimization problems, SIAM J. Matrix Anal. Appl., 29 (2007), pp. 752-773.
    • (2007) SIAM J. Matrix Anal. Appl. , vol.29 , pp. 752-773
    • Schöberl, J.1    Zulehner, W.2
  • 33
    • 1542379947 scopus 로고    scopus 로고
    • Block triangular preconditioners for symmetric saddle-point problems
    • V. SIMONCINI, Block triangular preconditioners for symmetric saddle-point problems, Appl. Numer. Math., 49 (2004), pp. 63-80.
    • (2004) Appl. Numer. Math. , vol.49 , pp. 63-80
    • Simoncini, V.1
  • 35
    • 67649206999 scopus 로고    scopus 로고
    • Combination preconditioning and the Bramble-Pasciak+ preconditioned
    • M. STOLL AND A. WATHEN, Combination preconditioning and the Bramble-Pasciak+ preconditioned SIAM J. Matrix Anal. Appl., 30 (2008), pp. 582-608.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , pp. 582-608
    • Stoll, M.1    Wathen, A.2
  • 36
    • 0001249354 scopus 로고    scopus 로고
    • Primal-dual interior-point methods
    • Philadelphia
    • S. J. WRIGHT, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, 1997.
    • (1997) SIAM
    • Wright, S.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.