메뉴 건너뛰기




Volumn 34, Issue 1, 1996, Pages 389-406

Multiplicative interior gradient methods for minimization over the nonnegative orthant

Author keywords

Gradient methods; Multiplicative iterative algorithms; Proximal methods; divergences

Indexed keywords

ALGORITHMS; BOUNDARY ELEMENT METHOD; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIAL EQUATIONS; FUNCTIONS; ITERATIVE METHODS; SET THEORY;

EID: 0029755280     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012994262944     Document Type: Article
Times cited : (6)

References (13)
  • 2
    • 0000489740 scopus 로고
    • Information-type measures of difference of probability distributions and indirect observations
    • I. CSISZÁR, Information-type measures of difference of probability distributions and indirect observations, Studia Sci. Math. Hungar., 2 (1967), pp. 299-318.
    • (1967) Studia Sci. Math. Hungar. , vol.2 , pp. 299-318
    • Csiszár, I.1
  • 3
    • 0000754239 scopus 로고
    • Iterative solutions of problems of linear and quadratic programming
    • I.I. DIKIN, Iterative solutions of problems of linear and quadratic programming, Soviet Math. Dokl., 8 (1967), pp. 674-675.
    • (1967) Soviet Math. Dokl. , vol.8 , pp. 674-675
    • Dikin, I.I.1
  • 4
    • 0002815417 scopus 로고
    • Multiplicative iterative algorithms for convex programming
    • P. P. B. EGGERMONT, Multiplicative iterative algorithms for convex programming, Linear Algebra Appl., 130 (1990), pp. 25-42.
    • (1990) Linear Algebra Appl. , vol.130 , pp. 25-42
    • Eggermont, P.P.B.1
  • 5
    • 0040314261 scopus 로고
    • On the method of generalized stochastic gradients and quasi-Fejér sequences
    • YU. M. ERMOL'EV, On the method of generalized stochastic gradients and quasi-Fejér sequences, Cybernetics, 5 (1969), pp. 208-220.
    • (1969) Cybernetics , vol.5 , pp. 208-220
    • Ermol'ev, Yu.M.1
  • 6
    • 0026876871 scopus 로고
    • Path following methods for linear programming
    • C. G. GONZAGA, Path following methods for linear programming, SIAM Rev., 34 (1992), pp. 167-224.
    • (1992) SIAM Rev. , vol.34 , pp. 167-224
    • Gonzaga, C.G.1
  • 7
    • 85033854053 scopus 로고    scopus 로고
    • Interior point multiplicative methods for optimization under positivity constraints
    • to appear
    • A. N. IUSEM, Interior point multiplicative methods for optimization under positivity constraints, Acta Appl. Math., to appear.
    • Acta Appl. Math.
    • Iusem, A.N.1
  • 8
    • 0000148237 scopus 로고
    • Entropy-like proximal methods in convex programming
    • A. N. IUSEM, B. F. SVAITER, AND M. TEBOULLE, Entropy-like proximal methods in convex programming, Math. Oper. Res., 19 (1994), pp. 790-814.
    • (1994) Math. Oper. Res. , vol.19 , pp. 790-814
    • Iusem, A.N.1    Svaiter, B.F.2    Teboulle, M.3
  • 9
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • N. KARMARKAR, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 10
    • 0002676589 scopus 로고
    • The Proximal Algorithm
    • Birkhauser-Verlag, Basel
    • B. LEMAIRE, The Proximal Algorithm, Internat. Ser. Numer. Math. 87, Birkhauser-Verlag, Basel, 1989, pp. 73-87.
    • (1989) Internat. Ser. Numer. Math. , vol.87 , pp. 73-87
    • Lemaire, B.1
  • 12
    • 0016985417 scopus 로고
    • Monotone operators and the proximal point algorithm
    • R. T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
    • (1976) SIAM J. Control Optim. , vol.14 , pp. 877-898
    • Rockafellar, R.T.1
  • 13
    • 0001286634 scopus 로고
    • Entropic proximal mappings with applications to nonlinear programming
    • M. TEBOULLE, Entropic proximal mappings with applications to nonlinear programming, Math. Oper. Res., 17 (1992), pp. 670-690.
    • (1992) Math. Oper. Res. , vol.17 , pp. 670-690
    • Teboulle, M.1


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