메뉴 건너뛰기




Volumn 125, Issue 3, 2005, Pages 609-628

Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions

Author keywords

Convergence; Interior point methods; Nonlinear programming

Indexed keywords

CONVERGENCE; CONVERGENCE ANALYSIS; GLOBAL CONVER-GENCE; INTERIOR-POINT METHOD; LIMIT POINTS; LINE SEARCHES; MERIT FUNCTION; PRIMAL-DUAL; REGULARITY ASSUMPTION; SEARCH STRATEGIES;

EID: 21444446016     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-005-2092-4     Document Type: Article
Times cited : (5)

References (17)
  • 1
    • 0000892372 scopus 로고    scopus 로고
    • Failure of global convergence for a class of interior-point methods for nonlinear programming
    • WÄCHTER, A., and BIEGLER, L. T., Failure of Global Convergence for a Class of Interior-Point Methods for Nonlinear Programming, Mathematical Programming, Vol. 88, pp. 565-574, 2000.
    • (2000) Mathematical Programming , vol.88 , pp. 565-574
    • Wächter, A.1    Biegler, L.T.2
  • 3
    • 0001130234 scopus 로고    scopus 로고
    • A trust-region method based on interior-point techniques for nonlinear programming
    • BYRD, R. H., GILBERT, J. C., and NOCEDAL, J., A Trust-Region Method Based on Interior-Point Techniques for Nonlinear Programming, Mathematical Programming, Vol. 89, pp. 149-185, 2000.
    • (2000) Mathematical Programming , vol.89 , pp. 149-185
    • Byrd, R.H.1    Gilbert, J.C.2    Nocedal, J.3
  • 4
    • 0038811730 scopus 로고    scopus 로고
    • Convergent infeasible interior-point trust-region methods for constrained minimization
    • TSENG, P., Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization, SIAM Journal on Optimization, Vol. 13, pp. 432-469, 2002.
    • (2002) SIAM Journal on Optimization , vol.13 , pp. 432-469
    • Tseng, P.1
  • 5
    • 4544345071 scopus 로고    scopus 로고
    • A Robust primal-dual interior-point algorithm for nonlinear programs
    • LIU, X. W., and SUN, J., A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs, SIAM Journal on Optimization, Vol.14, pp. 1163-1186, 2004.
    • (2004) SIAM Journal on Optimization , vol.14 , pp. 1163-1186
    • Liu, X.W.1    Sun, J.2
  • 6
    • 0033471382 scopus 로고    scopus 로고
    • An interior-point algorithm for large-scale nonlinear programming
    • BYRD, R. H., HRIBAR, M. E., and NOCEDAL, J., An Interior-Point Algorithm for Large-Scale Nonlinear Programming, SIAM Journal on Optimization, Vol. 9, pp. 877-900, 1999.
    • (1999) SIAM Journal on Optimization , vol.9 , pp. 877-900
    • Byrd, R.H.1    Hribar, M.E.2    Nocedal, J.3
  • 8
    • 0002443848 scopus 로고    scopus 로고
    • A primal-dual algorithm for minimizing a nonconvex function subject to bound and linear equality constraints
    • Edited by G. Di PILLO and F. GIANNESSI, Kluwer Academic Publishers, Dordrecht, Holland
    • CONN, A. R., GOULD, N., and TOINT, P. L., A Primal-Dual Algorithm for Minimizing a Nonconvex Function Subject to Bound and Linear Equality Constraints, Nonlinear Optimization and Applications 2, Edited by G. Di PILLO and F. GIANNESSI, Kluwer Academic Publishers, Dordrecht, Holland, 1999.
    • (1999) Nonlinear Optimization and Applications , vol.2
    • Conn, A.R.1    Gould, N.2    Toint, P.L.3
  • 10
    • 0032358968 scopus 로고    scopus 로고
    • Primal-dual interior methods for nonconvex nonlinear programming
    • FORSGREN, A., and GILL, P. E., Primal-Dual Interior Methods for Nonconvex Nonlinear Programming, SIAM Journal on Optimization, Vol. 8, pp. 1132-1152, 1998.
    • (1998) SIAM Journal on Optimization , vol.8 , pp. 1132-1152
    • Forsgren, A.1    Gill, P.E.2
  • 12
    • 0000547919 scopus 로고
    • Primal-dual and primal interior-point algorithms for general nonlinear programs
    • LASDON, L. S., PLUMMER, J., and YU, G., Primal-Dual and Primal Interior-Point Algorithms for General Nonlinear Programs, ORSA Journal on Computing, Vol. 7, pp. 321-332, 1995.
    • (1995) ORSA Journal on Computing , vol.7 , pp. 321-332
    • Lasdon, L.S.1    Plummer, J.2    Yu, G.3
  • 13
    • 29044447101 scopus 로고    scopus 로고
    • Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods
    • SHANNO, D. F., and VANDERBEI, R. J., Interior-Point Methods for Nonconvex Nonlinear Programming: Orderings and Higher-Order Methods, Mathematical Programming, Vol. 87, pp. 303-316, 2000.
    • (2000) Mathematical Programming , vol.87 , pp. 303-316
    • Shanno, D.F.1    Vanderbei, R.J.2
  • 14
  • 15
    • 0013058763 scopus 로고    scopus 로고
    • A global convergent primal-dual interior-point method for constrained optimization
    • YAMASHITA, H., A Global Convergent Primal-Dual Interior-Point Method for Constrained Optimization, Optimization Methods and Software, Vol. 10, pp. 448-469, 1998.
    • (1998) Optimization Methods and Software , vol.10 , pp. 448-469
    • Yamashita, H.1
  • 16
    • 0035074966 scopus 로고    scopus 로고
    • A Robust algorithm for optimization with general equality and inequality constraints
    • LIU, X. W., and YUAN, Y., A Robust Algorithm for Optimization with General Equality and Inequality Constraints, SIAM Journal on Statistical and Scientific Computing, Vol. 22, pp. 517-534, 2000.
    • (2000) SIAM Journal on Statistical and Scientific Computing , vol.22 , pp. 517-534
    • Liu, X.W.1    Yuan, Y.2


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