메뉴 건너뛰기




Volumn 168, Issue 1, 2005, Pages 651-676

An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems

Author keywords

Elliptic control problems; Hestenes multipliers' method; Inexact Newton method; Large scale nonlinear programming problems; Newton interior point method

Indexed keywords

APPROXIMATION THEORY; DAMPING; ITERATIVE METHODS; LINEAR EQUATIONS; LINEAR PROGRAMMING; PARAMETER ESTIMATION; PERTURBATION TECHNIQUES; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

EID: 25644459151     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2004.09.018     Document Type: Article
Times cited : (6)

References (22)
  • 3
    • 0003579810 scopus 로고
    • MA27-a set of Fortran subroutines for solving sparse symmetric sets of linear equations
    • HMSO, London
    • I.S. Duff, J.K. Reid, MA27-a set of Fortran subroutines for solving sparse symmetric sets of linear equations, Tech Report AERE R10533, HMSO, London, 1982.
    • (1982) Tech Report , vol.AERE R10533
    • Duff, I.S.1    Reid, J.K.2
  • 4
    • 0034349445 scopus 로고    scopus 로고
    • On the Newton interior-point method for nonlinear programming problems
    • C. Durazzi On the Newton interior-point method for nonlinear programming problems J. Optim. Theory Appl. 104 2000 73 90
    • (2000) J. Optim. Theory Appl. , vol.104 , pp. 73-90
    • Durazzi, C.1
  • 6
    • 0347723949 scopus 로고    scopus 로고
    • Global convergence of the Newton interior-point method for nonlinear programming
    • C. Durazzi, and V. Ruggiero Global convergence of the Newton interior-point method for nonlinear programming J. Optim. Theory Appl. 120 2004 199 208
    • (2004) J. Optim. Theory Appl. , vol.120 , pp. 199-208
    • Durazzi, C.1    Ruggiero, V.2
  • 7
    • 3843101574 scopus 로고    scopus 로고
    • A Newton inexact interior-point method for large scale nonlinear optimization problems
    • C. Durazzi, V. Ruggiero, A Newton inexact interior-point method for large scale nonlinear optimization problems, Annali Univ. Ferrara, Sez. VII, Sc. Matem. IL, (2003) 333-357.
    • (2003) Annali Univ. Ferrara, Sez. VII, Sc. Matem. IL , pp. 333-357
    • Durazzi, C.1    Ruggiero, V.2
  • 8
    • 0035536764 scopus 로고    scopus 로고
    • Parallel interior-point method for linear and quadratic programs with special structure
    • C. Durazzi, V. Ruggiero, and G. Zanghirati Parallel interior-point method for linear and quadratic programs with special structure J. Optim. Theory Appl. 110 2001 289 313
    • (2001) J. Optim. Theory Appl. , vol.110 , pp. 289-313
    • Durazzi, C.1    Ruggiero, V.2    Zanghirati, G.3
  • 9
    • 0001330894 scopus 로고
    • Globally convergent inexact Newton methods
    • S.C. Eisenstat, and H.F. Walker Globally convergent inexact Newton methods SIAM J. Optim. 4 1994 393 422
    • (1994) SIAM J. Optim. , vol.4 , pp. 393-422
    • Eisenstat, S.C.1    Walker, H.F.2
  • 10
    • 0030541525 scopus 로고    scopus 로고
    • On the formulation and theory of Newton interior-point method for nonlinear programming
    • A.S. El-Bakry, R.A. Tapia, T. Tsuchiya, and Y. Zhang On the formulation and theory of Newton interior-point method for nonlinear programming J. Optim. Theory Appl. 89 1996 507 541
    • (1996) J. Optim. Theory Appl. , vol.89 , pp. 507-541
    • El-Bakry, A.S.1    Tapia, R.A.2    Tsuchiya, T.3    Zhang, Y.4
  • 11
    • 25644436677 scopus 로고    scopus 로고
    • Analysis of the convergence of an inexact Newton method for solving Karush-Kuhn-Tucker systems
    • in press
    • E. Galligani, Analysis of the convergence of an inexact Newton method for solving Karush-Kuhn-Tucker systems, Atti Sem. Matem. Fis. Univ. Modena, in press.
    • Atti Sem. Matem. Fis. Univ. Modena
    • Galligani, E.1
  • 12
    • 0022061431 scopus 로고
    • On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
    • N.I.M. Gould On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem Math. Program. 32 1985 90 99
    • (1985) Math. Program. , vol.32 , pp. 90-99
    • Gould, N.I.M.1
  • 14
    • 21144482411 scopus 로고
    • On finding supernodes for sparse matrix computations
    • J.W. Liu, E.G. Ng, and B.W. Peyton On finding supernodes for sparse matrix computations SIAM J. Matrix Anal. Appl. 14 1993 242 252
    • (1993) SIAM J. Matrix Anal. Appl. , vol.14 , pp. 242-252
    • Liu, J.W.1    Ng, E.G.2    Peyton, B.W.3
  • 16
    • 0033738978 scopus 로고    scopus 로고
    • Optimization techniques for solving elliptic control problems with control and state constraints: Part 1. Boundary control
    • 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 29 55
    • (2000) Comput. Optim. Appl. , vol.16 , pp. 29-55
    • Maurer, H.1    Mittelmann, H.D.2
  • 17
    • 0035248626 scopus 로고    scopus 로고
    • Optimization techniques for solving elliptic control problems with control and state constraints: Part 2. Distributed control
    • H. Maurer, and H.D. Mittelmann Optimization techniques for solving elliptic control problems with control and state constraints: Part 2. Distributed control Comput. Optim. Appl. 18 2001 141 160
    • (2001) Comput. Optim. Appl. , vol.18 , pp. 141-160
    • Maurer, H.1    Mittelmann, H.D.2
  • 18
    • 0034255203 scopus 로고    scopus 로고
    • Solving elliptic control problems with interior point and SQP methods: Control and state constraint
    • H.D. Mittelmann, and H. Maurer Solving elliptic control problems with interior point and SQP methods: control and state constraint J. Comput. Appl. Math. 120 2000 175 195
    • (2000) J. Comput. Appl. Math. , vol.120 , pp. 175-195
    • Mittelmann, H.D.1    Maurer, H.2
  • 22
    • 0000287204 scopus 로고    scopus 로고
    • An interior-point algorithm for nonconvex nonlinear programming
    • R.J. Vanderbei, and D.F. Shanno An interior-point algorithm for nonconvex nonlinear programming Comput. Optim. Appl. 13 1999 231 252
    • (1999) Comput. Optim. Appl. , vol.13 , pp. 231-252
    • Vanderbei, R.J.1    Shanno, D.F.2


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