메뉴 건너뛰기




Volumn 15, Issue 3-4, 2001, Pages 225-256

An interior point algorithm for global optimal solutions and KKT points

Author keywords

Global optimization; Interior point methods; Karush Kuhn Tucker points

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FINITE ELEMENT METHOD; NONLINEAR PROGRAMMING;

EID: 0036459440     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (5)

References (23)
  • 1
    • 51249181779 scopus 로고
    • A new polynomial time algorithm in linear programming
    • N. Karmarkar (1984). A new polynomial time algorithm in linear programming. Combinatorica, 4, 373-395.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 2
    • 0022756624 scopus 로고
    • Karmarkar's linear programming algorithm
    • N. Hooker (1986). Karmarkar's linear programming algorithm. Interfaces, 16, 75-90.
    • (1986) Interfaces , vol.16 , pp. 75-90
    • Hooker, N.1
  • 3
    • 84966258893 scopus 로고
    • The nonlinear geometry of linear programming I
    • D.A. Bayer and J.C. Lagarias (1989). The nonlinear geometry of linear programming I. Trans. Amer. Math. Soc. 314, 499-526.
    • (1989) Trans. Amer. Math. Soc. , vol.314 , pp. 499-526
    • Bayer, D.A.1    Lagarias, J.C.2
  • 5
    • 0002521591 scopus 로고
    • The use of ordinary differential equations in the solution of nonlinear systems of equations
    • M.J.D. Powell, (Ed.), Academic Press, New York
    • F. Zirilli (1982). The use of ordinary differential equations in the solution of nonlinear systems of equations. In: M.J.D. Powell, (Ed.), Nonlinear Optimization 1981, pp. 39-47, Academic Press, New York.
    • (1982) Nonlinear Optimization 1981 , pp. 39-47
    • Zirilli, F.1
  • 6
    • 0034134704 scopus 로고    scopus 로고
    • A monotonic variable - Metric algorithm for linearly constrained nonlinear programming
    • G. Pacelli and M.C. Recchioni (2000). A monotonic variable - metric algorithm for linearly constrained nonlinear programming. JOTA 104, 255-279.
    • (2000) JOTA , vol.104 , pp. 255-279
    • Pacelli, G.1    Recchioni, M.C.2
  • 8
    • 0003333494 scopus 로고
    • Mathematical developments arising from linear programming
    • American Mathematical Society, Providence, Rhode Island
    • J.C. Lagarias and M.J. Todd (Eds.) (1990). Mathematical developments arising from linear programming. In: Contemporary Mathematics, 114, American Mathematical Society, Providence, Rhode Island.
    • (1990) Contemporary Mathematics , vol.114
    • Lagarias, J.C.1    Todd, M.J.2
  • 9
    • 34249970989 scopus 로고
    • An extension of Karmarkar's projective algorithm for convex quadratic programming
    • Y. Ye and E. Tse (1989). An extension of Karmarkar's projective algorithm for convex quadratic programming. Mathematical Programming, 44, 157-179.
    • (1989) Mathematical Programming , vol.44 , pp. 157-179
    • Ye, Y.1    Tse, E.2
  • 11
    • 0012089322 scopus 로고
    • Minimizing and maximizing the product of linear fractional functions
    • C.A. Floudas and P.M. Pardalos (Eds.), Princeton University Press, Princeton
    • H. Konno and Y. Yajima (1992). Minimizing and maximizing the product of linear fractional functions. In: C.A. Floudas and P.M. Pardalos (Eds.), Recent Advances in Global Optimization, pp. 259-273, Princeton University Press, Princeton.
    • (1992) Recent Advances in Global Optimization , pp. 259-273
    • Konno, H.1    Yajima, Y.2
  • 12
    • 0024665753 scopus 로고
    • Interior path following primal-dual algorithms. Part II: Convex Quadratic programming
    • R.D.C. Monteiro and I. Adler (1989). Interior path following primal-dual algorithms. Part II: Convex Quadratic programming. Mathematical Programming, 44, 43-66.
    • (1989) Mathematical Programming , vol.44 , pp. 43-66
    • Monteiro, R.D.C.1    Adler, I.2
  • 16
    • 0000302389 scopus 로고
    • Linear fractional functional programming
    • K. Swarup (1965). Linear fractional functional programming. Operations Research, 13, 1029-1036.
    • (1965) Operations Research , vol.13 , pp. 1029-1036
    • Swarup, K.1
  • 17
    • 0001720476 scopus 로고
    • On the convergence of gradient methods under constraints
    • P. Wolfe (1972). On the convergence of gradient methods under constraints. IBM Journal of Research and Development, 16, 407-411.
    • (1972) IBM Journal of Research and Development , vol.16 , pp. 407-411
    • Wolfe, P.1
  • 18
    • 0027577963 scopus 로고
    • On the convergence of the projected gradient method
    • J.P. Dussault and G. Fournier (1993). On the convergence of the projected gradient method. JOTA, 77, 197-208.
    • (1993) JOTA , vol.77 , pp. 197-208
    • Dussault, J.P.1    Fournier, G.2
  • 19
    • 0002168842 scopus 로고
    • Optimizing the sum of linear fractional functions
    • C.A. Floudas and P.M. Pardalos (Eds.), Princeton University Press, Princeton
    • J.E. Falk and S.W. Polacsay (1992). Optimizing the sum of linear fractional functions. In: C.A. Floudas and P.M. Pardalos (Eds.), Recent Advances in Global Optimization, pp. 221-258, Princeton University Press, Princeton,
    • (1992) Recent Advances in Global Optimization , pp. 221-258
    • Falk, J.E.1    Polacsay, S.W.2
  • 20
    • 0002560431 scopus 로고
    • A class of fractional programming problems
    • Y. Almogy and O. Levin (1971). A class of fractional programming problems. Operations Research, 19, 57-67.
    • (1971) Operations Research , vol.19 , pp. 57-67
    • Almogy, Y.1    Levin, O.2
  • 21
    • 0003246224 scopus 로고
    • More test examples for Nonlinear Programming codes
    • Springer-Verlag, Berlin, Heidelberg
    • K. Schittkowski (1987). More test examples for Nonlinear Programming codes. In: Lecture Notes in Economics and Mathematical Systems, 282, Springer-Verlag, Berlin, Heidelberg.
    • (1987) Lecture Notes in Economics and Mathematical Systems , vol.282
    • Schittkowski, K.1


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