메뉴 건너뛰기




Volumn 180, Issue 1, 2005, Pages 201-211

Global convergence on an active set SQP for inequality constrained optimization

Author keywords

Active set; Nonlinearly constrained optimization; Sequential quadratic programming

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; OPTIMIZATION; SET THEORY;

EID: 17644411998     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2004.10.012     Document Type: Article
Times cited : (8)

References (24)
  • 2
    • 0011259121 scopus 로고
    • Constrained minimization using recursive equality quadratic programming
    • F.A. Lootsma (Eds.) Academic Press New York
    • M.C. Biggs Constrained minimization using recursive equality quadratic programming, in: F.A. Lootsma (Eds.) Numerical Methods for Nonlinear Optimization 1972 Academic Press New York 411-428
    • (1972) Numerical Methods for Nonlinear Optimization , pp. 411-428
    • Biggs, M.C.1
  • 3
    • 0024640194 scopus 로고
    • A robust sequential quadratic programming method
    • J.V. Burke S.P. Han A robust sequential quadratic programming method Math. Programming 43 1989 277-303
    • (1989) Math. Programming , vol.43 , pp. 277-303
    • Burke, J.V.1    Han, S.P.2
  • 5
    • 0013159608 scopus 로고    scopus 로고
    • Local convergence of SQP methods for mathematical programs with equilibrium constraints
    • Department of Mathematics, University of Dundee
    • R. Fletcher, S. Leyffer, D. Ralph, S. Scholtes, Local convergence of SQP methods for mathematical programs with equilibrium constraints, Numerical Analysis Report NA/209, Department of Mathematics, University of Dundee, 2002.
    • (2002) Numerical Analysis Report NA/209
    • Fletcher, R.1    Leyffer, S.2    Ralph, D.3    Scholtes, S.4
  • 7
    • 34250293137 scopus 로고
    • A globally convergent method for nonlinear programming
    • S.P. Han A globally convergent method for nonlinear programming J. Optim. Theory. Appl. 22 1977 297-309
    • (1977) J. Optim. Theory. Appl. , vol.22 , pp. 297-309
    • Han, S.P.1
  • 8
    • 0001336984 scopus 로고
    • Globally convergent Newton methods for nonsmooth equations
    • S.P. Han J.S. Pang N. Rangaraj Globally convergent Newton methods for nonsmooth equations Math. Oper. Res. 17 1992 586-607
    • (1992) Math. Oper. Res. , vol.17 , pp. 586-607
    • Han, S.P.1    Pang, J.S.2    Rangaraj, N.3
  • 10
    • 0038811738 scopus 로고    scopus 로고
    • Primal-dual active set strategy for a general class of constrained optimal control problems
    • K. Kunisch A. Rösch Primal-dual active set strategy for a general class of constrained optimal control problems SIAM J. Optim. 13 2002 321-334
    • (2002) SIAM J. Optim. , vol.13 , pp. 321-334
    • Kunisch, K.1    Rösch, A.2
  • 11
    • 17644419570 scopus 로고    scopus 로고
    • Global convergence of an active set SQP algorithm
    • Research Report ICM-97-82, ICMSEC
    • X.-W. Liu, Y. Yuan, Global convergence of an active set SQP algorithm, Research Report ICM-97-82, ICMSEC.
    • Liu, X.-W.1    Yuan, Y.2
  • 12
    • 0035074966 scopus 로고    scopus 로고
    • A robust algorithm for optimization with general equality and inequality constraints
    • X.-W. Liu Y.-X. Yuan A robust algorithm for optimization with general equality and inequality constraints SIAM J. Sci. Comput. 22 2000 517-534
    • (2000) SIAM J. Sci. Comput. , vol.22 , pp. 517-534
    • Liu, X.-W.1    Yuan, Y.-X.2
  • 13
    • 1542351153 scopus 로고    scopus 로고
    • A decomposition method based on SQP for a class of multistage stochastic programs
    • X.-W. Liu G. Zhao A decomposition method based on SQP for a class of multistage stochastic programs SIAM J. Optim. 14 2003 200-222
    • (2003) SIAM J. Optim. , vol.14 , pp. 200-222
    • Liu, X.-W.1    Zhao, G.2
  • 14
    • 0000380269 scopus 로고
    • A sequential quadratic programming algorithm using an incomplete solution of the subproblem
    • W. Murray F.J. 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, F.J.2
  • 15
    • 0000919210 scopus 로고
    • Serial and parallel computation of Karush-Kuhn-Tucker points via nonsmooth equations
    • J.S. Pang Serial and parallel computation of Karush-Kuhn-Tucker points via nonsmooth equations SIAM J. Optim. 4 1994 872-893
    • (1994) SIAM J. Optim. , vol.4 , pp. 872-893
    • Pang, J.S.1
  • 17
    • 0002336269 scopus 로고
    • The convergence of variable metric methods for nonlinear constrained optimization calculations
    • O.L. Mangasarian R.R. Meyer S.M. Robinson (Eds.) Academic Press New York
    • M.J.D. Powell The convergence of variable metric methods for nonlinear constrained optimization calculations, in: O.L. Mangasarian R.R. Meyer S.M. Robinson (Eds.) Nonlinear Programming 3 1978 Academic Press New York 27-63
    • (1978) Nonlinear Programming , vol.3 , pp. 27-63
    • Powell, M.J.D.1
  • 18
    • 0022755948 scopus 로고
    • A recursive quadratic programming algorithm that using differentiable exact penalty function
    • M.J.D. Powell Y. Yuan A recursive quadratic programming algorithm that using differentiable exact penalty function Math. Programming 35 1986 265-278
    • (1986) Math. Programming , vol.35 , pp. 265-278
    • Powell, M.J.D.1    Yuan, Y.2
  • 20
    • 34250129599 scopus 로고
    • NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems
    • K. Schittkowski NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems Ann. Oper. Res. 5 1986 485-500
    • (1986) Ann. Oper. Res. , vol.5 , pp. 485-500
    • Schittkowski, K.1
  • 21
    • 0000473086 scopus 로고    scopus 로고
    • Principles of sequential quadratic programming methods for solving nonlinear programs
    • K. Schittkowski (Ed.), Springer, Berlin
    • J. Stoer, Principles of sequential quadratic programming methods for solving nonlinear programs, in: K. Schittkowski (Ed.), NATO ASI Series, vol. F15, Computational Mathematical Programming, Springer, Berlin.
    • NATO ASI Series, Computational Mathematical Programming , vol.F15
    • Stoer, J.1
  • 22
    • 0030303859 scopus 로고    scopus 로고
    • A new merit function and a successive quadratic programming algorithm for variational inequality problems
    • K. Taji M. Fukushima A new merit function and a successive quadratic programming algorithm for variational inequality problems SIAM J. Optim. 6 1996 704-713
    • (1996) SIAM J. Optim. , vol.6 , pp. 704-713
    • Taji, K.1    Fukushima, M.2
  • 24
    • 17644379880 scopus 로고    scopus 로고
    • A robust SQP method for optimization with inequality constraints
    • J.L. Zhang X.S. Zhang A robust SQP method for optimization with inequality constraints J. Comput. Math. 21 2003 247-256
    • (2003) J. Comput. Math. , vol.21 , pp. 247-256
    • Zhang, J.L.1    Zhang, X.S.2


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