메뉴 건너뛰기




Volumn 100, Issue 2, 2004, Pages 379-410

A globally convergent primal-dual interior-point filter method for nonlinear programming

Author keywords

Filter; Global convergence; Interior point methods; Primal dual

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; OPTIMIZATION; PERTURBATION TECHNIQUES;

EID: 14944387007     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0477-4     Document Type: Article
Times cited : (159)

References (31)
  • 1
    • 0003695376 scopus 로고    scopus 로고
    • On the global convergence of a modified augmented Lagrangian line search interior point Newton method for nonlinear programming
    • Department of Computational and Applied Mathematics, Rice University, 1995. Revised September
    • Argaez, M., Tapia, R.A.: On the global convergence of a modified augmented Lagrangian line search interior point Newton method for nonlinear programming. Tech. Report TR95-38, Department of Computational and Applied Mathematics, Rice University, 1995. Revised September 1999
    • (1999) Tech. Report , vol.TR95-38
    • Argaez, M.1    Tapia, R.A.2
  • 2
    • 0041798103 scopus 로고    scopus 로고
    • A pattern search filter method for nonlinear programming without derivatives
    • Department of Computational and Applied Mathematics, Rice University
    • Audet, C., Dennis, I.E.: A pattern search filter method for nonlinear programming without derivatives. Tech. Report TR00-09, Department of Computational and Applied Mathematics, Rice University, 2000
    • (2000) Tech. Report , vol.TR00-09
    • Audet, C.1    Dennis, I.E.2
  • 3
    • 0003819902 scopus 로고    scopus 로고
    • Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
    • Operations Research and Financial Engineering, Princeton University
    • Benson, H.Y., Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions. Tech. Report ORFE-00-06, Operations Research and Financial Engineering, Princeton University, 2000
    • (2000) Tech. Report , vol.ORFE-00-06
    • Benson, H.Y.1    Shanno, D.F.2    Vanderbei, R.J.3
  • 4
    • 44649149897 scopus 로고
    • Sequential quadratic programming
    • A. Iserles, (ed.), Cambridge University Press, Cambridge, London, New York
    • Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. In: Acta Numerica 1995, A. Iserles, (ed.), Cambridge University Press, Cambridge, London, New York, 1995, pp. 1-51
    • (1995) Acta Numerica 1995 , pp. 1-51
    • Boggs, P.T.1    Tolle, J.W.2
  • 5
    • 0033471382 scopus 로고    scopus 로고
    • An interior point algorithm for large-scale nonlinear programming
    • Byrd, R.H., Hribar, M.E., Nocedal, J.: An interior point algorithm for large-scale nonlinear programming. SIAM J. Optim. 9, 877-900 (1999)
    • (1999) SIAM J. Optim. , vol.9 , pp. 877-900
    • Byrd, R.H.1    Hribar, M.E.2    Nocedal, J.3
  • 7
    • 0013502736 scopus 로고    scopus 로고
    • On the global convergence of an SLP-filter algorithm that takes EQP steps
    • Department of Mathematics, University of Dundee
    • Chin, C.M., Fletcher, R.: On the global convergence of an SLP-filter algorithm that takes EQP steps. Tech. Report NA/199, Department of Mathematics, University of Dundee, 2001
    • (2001) Tech. Report , vol.NA-199
    • Chin, C.M.1    Fletcher, R.2
  • 8
    • 34249771074 scopus 로고
    • On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
    • Coleman, T.F., Li, Y.: On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Program. 67, 189-224 (1994)
    • (1994) Math. Program. , vol.67 , pp. 189-224
    • Coleman, T.F.1    Li, Y.2
  • 9
    • 0002443848 scopus 로고    scopus 로고
    • A primal-dual trust-region algorithm for minimizing a non-convex function subject to general inequality and linear equality constraints
    • Kluwer Acad. Publ., Dordrecht
    • Conn, A.R., Gould, N.I.M., Orban, D., Toint P.L.: A primal-dual trust-region algorithm for minimizing a non-convex function subject to general inequality and linear equality constraints. In: Nonlinear optimization and related topics (Erice, 1998), Kluwer Acad. Publ., Dordrecht, 2000, pp. 15-49
    • (2000) Nonlinear Optimization and Related Topics (Erice, 1998) , pp. 15-49
    • Conn, A.R.1    Gould, N.I.M.2    Orban, D.3    Toint, P.L.4
  • 11
    • 0030541525 scopus 로고    scopus 로고
    • On the formulation and theory of the Newton interior-point method for nonlinear programming
    • El-Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang, Y.: On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optim. Theor. Appl. 89, 507-541 (1996)
    • (1996) J. Optim. Theor. Appl. , vol.89 , pp. 507-541
    • El-Bakry, A.S.1    Tapia, R.A.2    Tsuchiya, T.3    Zhang, Y.4
  • 12
    • 0042354662 scopus 로고    scopus 로고
    • Global convergence of trust-region SQP-filter algorithms for general nonlinear programming
    • Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, PL., Wächter, A.: Global convergence of trust-region SQP-filter algorithms for general nonlinear programming. SIAM J. Optim. 13, 635-659 (2002)
    • (2002) SIAM J. Optim. , vol.13 , pp. 635-659
    • Fletcher, R.1    Gould, N.I.M.2    Leyffer, S.3    Toint, P.L.4    Wächter, A.5
  • 13
    • 17444400138 scopus 로고    scopus 로고
    • User manual for filterSQP
    • Department of Mathematics, University of Dundee
    • Fletcher, R., Leyffer, S.: User manual for filterSQP. Tech. Report NA/181, Department of Mathematics, University of Dundee, 1998
    • (1998) Tech. Report , vol.NA-181
    • Fletcher, R.1    Leyffer, S.2
  • 14
    • 0001556338 scopus 로고    scopus 로고
    • Nonlinear programming without a penalty function
    • Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Programm. 91, 239-269 (2002)
    • (2002) Math. Programm. , vol.91 , pp. 239-269
    • Fletcher, R.1    Leyffer, S.2
  • 15
    • 0013468012 scopus 로고    scopus 로고
    • On the global convergence of an SLP-filter algorithm
    • Département de Mathématique, FUNDP, Namur
    • Fletcher, R., Leyffer, S., Toint, PL.: On the global convergence of an SLP-filter algorithm. Tech. Report 98/13, Département de Mathématique, FUNDP, Namur, 1998
    • (1998) Tech. Report , vol.98 , Issue.13
    • Fletcher, R.1    Leyffer, S.2    Toint, P.L.3
  • 16
    • 0032358968 scopus 로고    scopus 로고
    • Primal-dual interior methods for nonconvex nonlinear programming
    • Forsgren, A., Gill, P.E.: Primal-dual interior methods for nonconvex nonlinear programming. SIAM J. Optim. 8, 1132-1152 (1998)
    • (1998) SIAM J. Optim. , vol.8 , pp. 1132-1152
    • Forsgren, A.1    Gill, P.E.2
  • 17
    • 0002688960 scopus 로고    scopus 로고
    • A primal-dual interior method for nonconvex nonlinear programming
    • Beijing, China, Y. Yuan, (ed.), Kluwer Academic Publishers, Dordrecht, The Netherlands
    • Gay, D.M., Overton, M.L., Wright, M.H.: A primal-dual interior method for nonconvex nonlinear programming. In: Proceedings of the 1996 International Conference on Nonlinear Programming, Beijing, China, Y. Yuan, (ed.), Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 31-56
    • (1998) Proceedings of the 1996 International Conference on Nonlinear Programming , pp. 31-56
    • Gay, D.M.1    Overton, M.L.2    Wright, M.H.3
  • 18
    • 0000860416 scopus 로고    scopus 로고
    • Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
    • Heinkenschloss, M., Ulbrich, M., Ulbrich, S.: Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption. Math. Program. 86, 615-635 (1999)
    • (1999) Math. Program. , vol.86 , pp. 615-635
    • Heinkenschloss, M.1    Ulbrich, M.2    Ulbrich, S.3
  • 19
    • 0007294939 scopus 로고
    • On the characterization of q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
    • Martinez, H.J., Parada, Z., Tapia, R.A.: On the characterization of q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming. Boletin de la Sociedad Matematica Mexicana 1, 1-12 (1995)
    • (1995) Boletin de la Sociedad Matematica Mexicana , vol.1 , pp. 1-12
    • Martinez, H.J.1    Parada, Z.2    Tapia, R.A.3
  • 21
    • 0002621771 scopus 로고    scopus 로고
    • Error bounds and superlinear convergence analysis of some Newton-type methods in optimization
    • Kluwer Academic Publishers B.V.
    • Tseng,P.: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Nonlinear Optimization and Applications, Vol. 2, Kluwer Academic Publishers B.V., 1998
    • (1998) Nonlinear Optimization and Applications , vol.2
    • Tseng, P.1
  • 22
    • 21044440965 scopus 로고    scopus 로고
    • Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function
    • Ulbrich, M., Ulbrich, S.: Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function. Math. Program. 95, 103-135 (2003)
    • (2003) Math. Program. , vol.95 , pp. 103-135
    • Ulbrich, M.1    Ulbrich, S.2
  • 23
    • 0000287204 scopus 로고    scopus 로고
    • An interior-point algorithm for nonconvex nonlinear programming
    • Vanderbei, R J., Shanno, D.F.: An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231-252 (1999)
    • (1999) Comput. Optim. Appl. , vol.13 , pp. 231-252
    • Vanderbei, R.J.1    Shanno, D.F.2
  • 24
    • 0034293909 scopus 로고    scopus 로고
    • Local convergence of the affine-scaling interior-point algorithm for nonlinear programming
    • Vicente, L.N.: Local convergence of the affine-scaling interior-point algorithm for nonlinear programming. Comput. Optim. Appl. 17, 23-35 (2000)
    • (2000) Comput. Optim. Appl. , vol.17 , pp. 23-35
    • Vicente, L.N.1
  • 25
    • 0036737815 scopus 로고    scopus 로고
    • Local convergence of a primal-dual method for degenerate nonlinear programming
    • Vicente, L.N., Wright, S.J.: Local convergence of a primal-dual method for degenerate nonlinear programming. Comput. Optim. Appl. 22, 311-328 (2002)
    • (2002) Comput. Optim. Appl. , vol.22 , pp. 311-328
    • Vicente, L.N.1    Wright, S.J.2
  • 27
    • 0000892372 scopus 로고    scopus 로고
    • Failure of global convergence for a class of interior point methods for nonlinear programming
    • Wächter, W., Biegler, L.T.: Failure of global convergence for a class of interior point methods for nonlinear programming. Math. Program. 88, (2000)
    • Math. Program. , vol.88 , pp. 2000
    • Wächter, W.1    Biegler, L.T.2
  • 28
    • 0003717395 scopus 로고    scopus 로고
    • Global and local convergence of line search filter methods for nonlinear programming
    • CAPD, Department of Chemical Engineering, Carnegie Mellon University
    • Wächter, A., Biegler, L.T.: Global and local convergence of line search filter methods for nonlinear programming. Tech. Report B-01-09, CAPD, Department of Chemical Engineering, Carnegie Mellon University, 2001
    • (2001) Tech. Report , vol.B-01-09
    • Wächter, A.1    Biegler, L.T.2
  • 30
    • 0036671312 scopus 로고    scopus 로고
    • Properties of the log-barrier function on degenerate nonlinear programs
    • Wright, S.J., Orban, D.: Properties of the log-barrier function on degenerate nonlinear programs. Math. Oper. Res. 27, 585-613 (2003)
    • (2003) Math. Oper. Res. , vol.27 , pp. 585-613
    • Wright, S.J.1    Orban, D.2
  • 31
    • 0000273506 scopus 로고    scopus 로고
    • Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization
    • Yamashita, H., Yabe, H.: Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization. Math. Program. 75, 377-397 (1996)
    • (1996) Math. Program. , vol.75 , pp. 377-397
    • Yamashita, H.1    Yabe, H.2


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