메뉴 건너뛰기




Volumn 6, Issue 1, 1999, Pages 59-70

A hybrid projection-proximal point algorithm

Author keywords

Maximal monotone operators; Projection methods; Proximal point methods

Indexed keywords


EID: 22844456506     PISSN: 09446532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (205)

References (25)
  • 4
    • 25444438076 scopus 로고    scopus 로고
    • Proximal quasi-Newton methods for nondifferentiable convex optimization
    • To appear
    • X. Chen, M. Fukushima: Proximal quasi-Newton methods for nondifferentiable convex optimization, Mathematical Programming, To appear.
    • Mathematical Programming
    • Chen, X.1    Fukushima, M.2
  • 5
    • 0027113845 scopus 로고
    • On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
    • J. Eckstein, D. P. Bertsekas: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Mathematical Programming 55 (1992) 293-318.
    • (1992) Mathematical Programming , vol.55 , pp. 293-318
    • Eckstein, J.1    Bertsekas, D.P.2
  • 6
    • 34249925266 scopus 로고
    • Finite termination of the proximal point algorithm
    • M. C. Ferris: Finite termination of the proximal point algorithm, Mathematical Programming 50 (1991) 359-366.
    • (1991) Mathematical Programming , vol.50 , pp. 359-366
    • Ferris, M.C.1
  • 7
    • 0007016022 scopus 로고
    • New proximal point algorithms for convex minimization
    • O. Güler: New proximal point algorithms for convex minimization, SIAM Journal on Optimization 2 (1992) 649-664.
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 649-664
    • Güler, O.1
  • 8
    • 0002676589 scopus 로고
    • The proximal algorithm
    • J. P. Penot (ed.), Birkhäuser, Basel
    • B. Lemaire: The proximal algorithm, In: J. P. Penot (ed.), International Series of Numerical Mathematics, Birkhäuser, Basel, 1989, 73-87.
    • (1989) International Series of Numerical Mathematics , pp. 73-87
    • Lemaire, B.1
  • 9
    • 0000525522 scopus 로고
    • An approach to variable metric bundle methods
    • J. Henry, J.-P. Yvon (eds.), System Modelling and Optimization, Springer-Verlag, Berlin et al.
    • G. Lemaréchal, C. Sagastizábal: An approach to variable metric bundle methods, In: J. Henry, J.-P. Yvon (eds.), Lecture Notes in Control and Information Sciences No. 197, System Modelling and Optimization, Springer-Verlag, Berlin et al., 1994, 144-162.
    • (1994) Lecture Notes in Control and Information Sciences No. 197 , vol.197 , pp. 144-162
    • Lemaréchal, G.1    Sagastizábal, C.2
  • 10
    • 0000275440 scopus 로고    scopus 로고
    • Variable metric bundle methods: From conceptual to implementable forms
    • C. Lemaréchal, C. Sagastizábal: Variable metric bundle methods: From conceptual to implementable forms, Mathematical Programming 76 (1997) 393-410.
    • (1997) Mathematical Programming , vol.76 , pp. 393-410
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 11
    • 0001413137 scopus 로고
    • Asymptotic convergence analysis of the proximal point algorithm
    • F. J. Luque: Asymptotic convergence analysis of the proximal point algorithm, SIAM Journal on Control and Optimization 22 (1984) 277-293.
    • (1984) SIAM Journal on Control and Optimization , vol.22 , pp. 277-293
    • Luque, F.J.1
  • 13
    • 0001844687 scopus 로고    scopus 로고
    • A quasi-second-order proximal bundle algorithm
    • R. Mifflin: A quasi-second-order proximal bundle algorithm, Mathematical Programming 73 (1996) 51-72.
    • (1996) Mathematical Programming , vol.73 , pp. 51-72
    • Mifflin, R.1
  • 15
    • 0001720708 scopus 로고
    • Weak convergence theorems for nonexpansive mappings in Banach spaces
    • G. B. Passty: Weak convergence theorems for nonexpansive mappings in Banach spaces, Journal of Mathematical Analysis and Applications 67 (1979) 274-276.
    • (1979) Journal of Mathematical Analysis and Applications , vol.67 , pp. 274-276
    • Passty, G.B.1
  • 16
    • 85049776636 scopus 로고
    • Optimization Software, Inc., Publications Division, New York
    • B. T. Polyak: Introduction to Optimization, Optimization Software, Inc., Publications Division, New York, 1987.
    • (1987) Introduction to Optimization
    • Polyak, B.T.1
  • 17
    • 0041529728 scopus 로고
    • A preconditioning proximal Newton method for nondifferentiable convex optimization
    • Department of Applied Mathematics, University of New South Wales, Sydney, SW, Australia
    • L. Qi, X. Chen: A preconditioning proximal Newton method for nondifferentiable convex optimization, Technical Report AMR 95/20, Department of Applied Mathematics, University of New South Wales, Sydney, SW, Australia, 1995.
    • (1995) Technical Report AMR , vol.95 , Issue.20
    • Qi, L.1    Chen, X.2
  • 18
    • 0016950796 scopus 로고
    • Augmented Lagrangians and applications of the proximal point algorithm in convex programming
    • R. T. Rockafellar: Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Mathematics of Operations Research 1 (1976) 97-116.
    • (1976) Mathematics of Operations Research , vol.1 , pp. 97-116
    • Rockafellar, R.T.1
  • 21
    • 0003124748 scopus 로고    scopus 로고
    • A globally convergent inexact Newton method for systems of monotone equations
    • M. Fukushima, L. Qi (eds.), Kluwer Academic Publishers
    • M. V. Solodov, B. F. Svaiter: A globally convergent inexact Newton method for systems of monotone equations, In: M. Fukushima, L. Qi (eds.), Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Kluwer Academic Publishers, 1998, 355-369.
    • (1998) Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods , pp. 355-369
    • Solodov, M.V.1    Svaiter, B.F.2
  • 22
    • 0034187944 scopus 로고    scopus 로고
    • An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
    • submitted
    • M. V. Solodov, B. F. Svaiter: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions, Mathematics of Operations Research, submitted.
    • Mathematics of Operations Research
    • Solodov, M.V.1    Svaiter, B.F.2
  • 23
    • 85034493428 scopus 로고    scopus 로고
    • A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem
    • submitted
    • M. V. Solodov, B. F. Svaiter: A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem, SIAM Journal on Optimization, submitted.
    • SIAM Journal on Optimization
    • Solodov, M.V.1    Svaiter, B.F.2
  • 24
    • 0000488063 scopus 로고
    • On linear convergence of iterative methods for the variational inequality problem
    • P. Tseng: On linear convergence of iterative methods for the variational inequality problem, Journal of Computational and Applied Mathematics 60 (1995) 237-252.
    • (1995) Journal of Computational and Applied Mathematics , vol.60 , pp. 237-252
    • Tseng, P.1
  • 25
    • 0030303854 scopus 로고    scopus 로고
    • Asymptotic convergence analysis of some inexact proximal point algorithms for minimization
    • C. Zhu: Asymptotic convergence analysis of some inexact proximal point algorithms for minimization, SIAM Journal on Optimization 6 (1996) 626-637.
    • (1996) SIAM Journal on Optimization , vol.6 , pp. 626-637
    • Zhu, C.1


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