메뉴 건너뛰기




Volumn 18, Issue 7-8, 1997, Pages 723-744

On a proximal point method for convex optimization in banach spaces

Author keywords

Bochner integral; Bregman distance; Convex optimization problem; Proximal point method; Totally convex function; Uniformly convex Banach space

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; INTEGRAL EQUATIONS; ITERATIVE METHODS; MATHEMATICAL OPERATORS;

EID: 0031236035     PISSN: 01630563     EISSN: None     Source Type: Journal    
DOI: 10.1080/01630569708816788     Document Type: Article
Times cited : (29)

References (28)
  • 1
    • 0001884161 scopus 로고    scopus 로고
    • Metric and generalized projections in Banach spaces: Properties and applications
    • edited by A. Kartsatos, Marcel Dekker, New York
    • Alber, Ya., Metric and generalized projections in Banach spaces: properties and applications, In: Theory and Applications of Nonlinear Operators of Monotone and Accretive Type, edited by A. Kartsatos, Marcel Dekker, New York, 1996, 15-50.
    • (1996) Theory and Applications of Nonlinear Operators of Monotone and Accretive Type , pp. 15-50
    • Alber, Ya.1
  • 3
    • 85139379575 scopus 로고    scopus 로고
    • Convergence of Bregman-projection methods for solving convex feasibility problems in reflexive Banach spaces
    • to appear
    • Alber, Ya. and Butnariu, D., Convergence of Bregman-projection methods for solving convex feasibility problems in reflexive Banach spaces, J. Optim. Theory Appl., to appear.
    • J. Optim. Theory Appl.
    • Alber, Ya.1    Butnariu, D.2
  • 4
    • 38249031537 scopus 로고
    • The non-existence of smooth demands in general Banach spaces
    • Araujo, A., The non-existence of smooth demands in general Banach spaces, J. Math. Economics, 17, 1988, 309-319.
    • (1988) J. Math. Economics , vol.17 , pp. 309-319
    • Araujo, A.1
  • 6
    • 49949144765 scopus 로고
    • The relaxation method for finding common points of convex sets and its application to the solution of convex programming
    • Bregman, L.M., The relaxation method for finding common points of convex sets and its application to the solution of convex programming, USSR Comp. Math, and Math. Phys., 7, 1967, 200-217.
    • (1967) USSR Comp. Math, and Math. Phys. , vol.7 , pp. 200-217
    • Bregman, L.M.1
  • 7
    • 85041405321 scopus 로고
    • Analyse Fonctionelle - Théorie et Applications
    • Paris
    • Brezis, H., Analyse Fonctionelle - Théorie et Applications, Masson, Paris, 1987.
    • (1987) Masson
    • Brezis, H.1
  • 10
    • 5844303189 scopus 로고    scopus 로고
    • Iterative averaging of entropic projections for solving stochastic convex feasibility problems
    • to appear
    • Butnariu, D., Censor, Y. and Reich, S., Iterative averaging of entropic projections for solving stochastic convex feasibility problems, J. Comput. Appl. Math., to appear.
    • J. Comput. Appl. Math.
    • Butnariu, D.1    Censor, Y.2    Reich, S.3
  • 11
    • 0002884749 scopus 로고    scopus 로고
    • Local moduli of convexity and their application to finding almost common fixed points of measurable families of operators
    • Recent Developments in Optimization Theory and Nonlinear Analysis, edited by Y. Censor and S. Reich
    • Butnariu, D. and Iusem, A.N., Local moduli of convexity and their application to finding almost common fixed points of measurable families of operators, in: Recent Developments in Optimization Theory and Nonlinear Analysis, edited by Y. Censor and S. Reich, Amer. Math. Soc., Contemporary Mathematics Series, Vol. 204, 1997.
    • (1997) Amer. Math. Soc., Contemporary Mathematics Series , vol.204
    • Butnariu, D.1    Iusem, A.N.2
  • 13
    • 0019587748 scopus 로고
    • An iterative row action method for interval convex programming
    • Censor, Y. and Lent, A., An iterative row action method for interval convex programming, J. Optim. Theory Appl., 34(3), 1981, 321-353.
    • (1981) J. Optim. Theory Appl. , vol.34 , Issue.3 , pp. 321-353
    • Censor, Y.1    Lent, A.2
  • 14
    • 0030456727 scopus 로고    scopus 로고
    • Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization
    • Censor, Y. and Reich, S., Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization, Optimization, 37, 1996, 323-339.
    • (1996) Optimization , vol.37 , pp. 323-339
    • Censor, Y.1    Reich, S.2
  • 15
    • 0026883817 scopus 로고
    • Proximal minimization algorithm with D-functions
    • Censor, Y. and Zenios, S., Proximal minimization algorithm with D-functions, J. Optim. Theory Appl., 73(3), 1992, 451-464.
    • (1992) J. Optim. Theory Appl. , vol.73 , Issue.3 , pp. 451-464
    • Censor, Y.1    Zenios, S.2
  • 16
    • 0000433247 scopus 로고
    • Convergence analysis of a proximal-like optimization algorithm using Bregman functions
    • Chen, G. and Teboulle, M., Convergence analysis of a proximal-like optimization algorithm using Bregman functions, SIAM J. on Optimization, 3, 1993, 538-543.
    • (1993) SIAM J. on Optimization , vol.3 , pp. 538-543
    • Chen, G.1    Teboulle, M.2
  • 17
    • 34250257862 scopus 로고
    • Auxiliary problem principle and decomposition in optimization problems
    • Cohen, G., Auxiliary problem principle and decomposition in optimization problems, J. Optim. Theory Appl., 32, 1980, 277-305.
    • (1980) J. Optim. Theory Appl. , vol.32 , pp. 277-305
    • Cohen, G.1
  • 18
    • 0024113095 scopus 로고
    • Auxiliary problem principle extended to variational inequalities
    • Cohen, G., Auxiliary problem principle extended to variational inequalities, J. Optim. Theory Appl., 59, 1988, 325-333.
    • (1988) J. Optim. Theory Appl. , vol.59 , pp. 325-333
    • Cohen, G.1
  • 19
    • 0001702688 scopus 로고
    • Nonlinear proximal point algorithms using Bregman functions, with application to convex programming
    • Eckstein, J., Nonlinear proximal point algorithms using Bregman functions, with application to convex programming, Math. Oper. Res., 18, 1993, 202-226.
    • (1993) Math. Oper. Res. , vol.18 , pp. 202-226
    • Eckstein, J.1
  • 24
    • 0000019392 scopus 로고
    • Convergence rate analysis of nonquadratic proximal and augmented Lagrangian in convex programming
    • Iusem, A.N. and Teboulle, M., Convergence rate analysis of nonquadratic proximal and augmented Lagrangian in convex programming, Math. Oper. Res., 20, 1995, 657-677.
    • (1995) Math. Oper. Res. , vol.20 , pp. 657-677
    • Iusem, A.N.1    Teboulle, M.2
  • 27
    • 0016985417 scopus 로고
    • Monotone operators and the proximal point algorithm
    • Rockafellar, R.T., Monotone operators and the proximal point algorithm, SIAM Journal Contr. Optim., 14, 1976, 877-898.
    • (1976) SIAM Journal Contr. Optim. , vol.14 , pp. 877-898
    • Rockafellar, R.T.1


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