메뉴 건너뛰기




Volumn 82, Issue 3, 1998, Pages 413-448

An SQP method for general nonlinear programs using only equality constrained subproblems

Author keywords

Nonlinear programming; Sequential quadratic programming; SQP method

Indexed keywords


EID: 0001346976     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01580078     Document Type: Article
Times cited : (217)

References (38)
  • 2
    • 0026190240 scopus 로고
    • An exact penalization viewpoint of constrained optimization
    • J.W. Burke, An exact penalization viewpoint of constrained optimization, SIAM J. Control Optim. 29 (1991) 968-998.
    • (1991) SIAM J. Control Optim. , vol.29 , pp. 968-998
    • Burke, J.W.1
  • 3
    • 0025791660 scopus 로고
    • An analysis of reduced Hessian methods for constrained optimization
    • R.H. Byrd, J. Nocedal, An analysis of reduced Hessian methods for constrained optimization, Math. Programming 49 (1991) 285-323.
    • (1991) Math. Programming , vol.49 , pp. 285-323
    • Byrd, R.H.1    Nocedal, J.2
  • 4
    • 0028319529 scopus 로고
    • Representations of quasi-Newton-matrices and their use in limited memory methods
    • R.H. Byrd, J. Nocedal, R.B. Schnabel, Representations of quasi-Newton-matrices and their use in limited memory methods, Math. Programming 63 (1994) 129-156.
    • (1994) Math. Programming , vol.63 , pp. 129-156
    • Byrd, R.H.1    Nocedal, J.2    Schnabel, R.B.3
  • 5
    • 34250234852 scopus 로고
    • Nonlinear programming via an exact penalty function: Global analysis
    • Th.F. Coleman, A.R. Conn, Nonlinear programming via an exact penalty function: Global analysis, Math. Programming 24 (1982) 137-161.
    • (1982) Math. Programming , vol.24 , pp. 137-161
    • Coleman, Th.F.1    Conn, A.R.2
  • 6
    • 34250234854 scopus 로고
    • Nonlinear programming via an exact penalty function: Asymptotic analysis
    • Th.F. Coleman, A.R. Conn, Nonlinear programming via an exact penalty function: Asymptotic analysis, Math. Programming 24 (1982) 123-136.
    • (1982) Math. Programming , vol.24 , pp. 123-136
    • Coleman, Th.F.1    Conn, A.R.2
  • 7
    • 0021477252 scopus 로고
    • On the local convergence of a quasi-Newton-method for the nonlinear programming problem
    • Th.F. Coleman, A.R. Conn, On the local convergence of a quasi-Newton-method for the nonlinear programming problem, SIAM J. Numer. Anal. 21 (1984) 755-769.
    • (1984) SIAM J. Numer. Anal. , vol.21 , pp. 755-769
    • Coleman, Th.F.1    Conn, A.R.2
  • 8
    • 0026707009 scopus 로고
    • Partitioned quasi-Newton methods for nonlinear equality constrained optimization
    • Th.F. Coleman, P.A. Fenyes, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, Math. Programming 53 (1992) 17-44.
    • (1992) Math. Programming , vol.53 , pp. 17-44
    • Coleman, Th.F.1    Fenyes, P.A.2
  • 9
    • 0042455890 scopus 로고
    • A penalty function method converging directly to a constrained optimum
    • A.R. Conn, T. Pietrzykowski, A penalty function method converging directly to a constrained optimum, SIAM J. Numer. Anal. 14 (1977) 348-374.
    • (1977) SIAM J. Numer. Anal. , vol.14 , pp. 348-374
    • Conn, A.R.1    Pietrzykowski, T.2
  • 11
    • 0344540555 scopus 로고
    • A set of geometric programming test problems and their solutions
    • R.S. Dembo, A set of geometric programming test problems and their solutions, Math. Programming 10 (1976) 192-213.
    • (1976) Math. Programming , vol.10 , pp. 192-213
    • Dembo, R.S.1
  • 15
    • 0001837582 scopus 로고
    • Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
    • D. Gabay, Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization, Math. Programming Stud. 16 (1982) 18-44.
    • (1982) Math. Programming Stud. , vol.16 , pp. 18-44
    • Gabay, D.1
  • 16
    • 0001596694 scopus 로고
    • Numerically stable methods for quadratic programming
    • Ph.E. Gill, W. Murray, Numerically stable methods for quadratic programming, Math. Programming 14 (1978) 349-372.
    • (1978) Math. Programming , vol.14 , pp. 349-372
    • Gill, Ph.E.1    Murray, W.2
  • 17
    • 0003113842 scopus 로고
    • Some theoretical properties of an augmented lagrangian merit function
    • P.M. Pardalos (Ed.), North Holland, Amsterdam
    • Ph.E. Gill, W. Murray, M. Saunders, M.H. Wright, Some theoretical properties of an augmented Lagrangian merit function, in: P.M. Pardalos (Ed.), Advances in Optimization and Parallel Computing, North Holland, Amsterdam, 1992, pp. 101-128.
    • (1992) Advances in Optimization and Parallel Computing , pp. 101-128
    • Gill, Ph.E.1    Murray, W.2    Saunders, M.3    Wright, M.H.4
  • 20
    • 0042956931 scopus 로고
    • Local convergence of a two-piece update of a projected Hessian matrix
    • Ch. Gurwitz, Local convergence of a two-piece update of a projected Hessian matrix, SIAM J. Optim. 4 (1994) 461-485.
    • (1994) SIAM J. Optim. , vol.4 , pp. 461-485
    • Gurwitz, Ch.1
  • 21
    • 0042803448 scopus 로고
    • Sequential quadratic programming methods based on approximating a projected Hessian matrix
    • Ch. Gurwitz, M. Overton, Sequential quadratic programming methods based on approximating a projected Hessian matrix, SIAM J. Sci. Comp. 10 (1989) 631-653.
    • (1989) SIAM J. Sci. Comp. , vol.10 , pp. 631-653
    • Gurwitz, Ch.1    Overton, M.2
  • 23
    • 0028728570 scopus 로고
    • A successful implementation of the Pantoja-Mayne SQP method
    • J. Heinz, P. Spellucci, A successful implementation of the Pantoja-Mayne SQP method, Optim. Meth. Software 4 (1994) 1-28.
    • (1994) Optim. Meth. Software , vol.4 , pp. 1-28
    • Heinz, J.1    Spellucci, P.2
  • 25
    • 0002897657 scopus 로고
    • A superlinearly convergent algorithm for constrained optimization problems
    • D.Q. Mayne, E. Polak, A superlinearly convergent algorithm for constrained optimization problems, Math. Programming Stud. 16 (1982) 45-61.
    • (1982) Math. Programming Stud. , vol.16 , pp. 45-61
    • Mayne, D.Q.1    Polak, E.2
  • 26
    • 0026173397 scopus 로고
    • Exact penalty function algorithm with simple updating of the penalty parameter
    • J.F.A. Pantoja, D.Q. Mayne, Exact penalty function algorithm with simple updating of the penalty parameter, J. Optim. Theory Appl. 69 (1991) 441-467.
    • (1991) J. Optim. Theory Appl. , vol.69 , pp. 441-467
    • Pantoja, J.F.A.1    Mayne, D.Q.2
  • 27
    • 0000380269 scopus 로고
    • A sequential quadratic programming algorithm using an incomplete solution of the subproblem
    • W. Murray, J.P. Prieto, A sequential quadratic programming algorithm using an incomplete solution of the subproblem, SIAM J. Optim. 5 (1995) 590-640.
    • (1995) SIAM J. Optim. , vol.5 , pp. 590-640
    • Murray, W.1    Prieto, J.P.2
  • 28
    • 0022145863 scopus 로고
    • Projected Hessian updating algorithms for nonlinearly constrained optimization
    • J. Nocedal, M. Overton, Projected Hessian updating algorithms for nonlinearly constrained optimization, SIAM J. Numer. Anal. 22 (1985) 821-850.
    • (1985) SIAM J. Numer. Anal. , vol.22 , pp. 821-850
    • Nocedal, J.1    Overton, M.2
  • 30
    • 34250232455 scopus 로고
    • The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangian type line search function I, II
    • K. Schittkowski, The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangian type line search function I, II, Numer. Math. 38 (1981) 83-128.
    • (1981) Numer. Math. , vol.38 , pp. 83-128
    • Schittkowski, K.1
  • 33
    • 0011383444 scopus 로고    scopus 로고
    • code obtainable via anonymous ftp from netlib as netlib/opt/donlp2
    • P. Spellucci, donlp2: do nonlinear programming, code obtainable via anonymous ftp from netlib as netlib/opt/donlp2.
    • Donlp2: Do Nonlinear Programming
    • Spellucci, P.1
  • 35
    • 0042956932 scopus 로고
    • Sequential quadratic programming: Theory, implementation, problems
    • M.J. Beckmann, K.W. Gaede, K. Ritter, H. Schneeweiss (Eds.), Anton Hain, Meisenheim
    • P. Spellucci, Sequential quadratic programming: Theory, implementation, problems, in: M.J. Beckmann, K.W. Gaede, K. Ritter, H. Schneeweiss (Eds.), Methods of Operations Research, vol. 53, Anton Hain, Meisenheim, 1985, pp. 183-213.
    • (1985) Methods of Operations Research , vol.53 , pp. 183-213
    • Spellucci, P.1
  • 36
    • 0008546556 scopus 로고
    • A new technique for inconsistent QP-problems in the SQP-method
    • Technical University at Darmstadt, Department of Mathematics, preprint 1561, Darmstadt
    • P. Spellucci, A new technique for inconsistent QP-problems in the SQP-method, Technical University at Darmstadt, Department of Mathematics, preprint 1561, Darmstadt (1993), to appear in Mathematical Methods of Operations Research, vol. 48 (1998).
    • (1993) Mathematical Methods of Operations Research , vol.48
    • Spellucci, P.1
  • 37
    • 0000672950 scopus 로고
    • The effects of rounding error on an algorithm for downdating a Cholesky factorization
    • G.W. Stewart, The effects of rounding error on an algorithm for downdating a Cholesky factorization, J.I.M.A. 23 (1979) 203-213.
    • (1979) J.I.M.A. , vol.23 , pp. 203-213
    • Stewart, G.W.1


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