SCOPUS 정보 검색 플랫폼

Volumn 8, Issue C, 2001, Pages 1-9

A log-quadratic projection method for convex feasibility problems

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043115714 PISSN: 1570579X EISSN: None Source Type: Book Series
DOI: 10.1016/S1570-579X(01)80002-1 Document Type: Chapter

Times cited : (5)

References (12)

2
- 0002434986
- A Logarithmic-Quadratic Proximal Method for Variational Inequalities
- Auslender A., Teboulle M., and Ben-Tiba S. A Logarithmic-Quadratic Proximal Method for Variational Inequalities. Computational Optimization and Applications 12 (1999) 31-40
- (1999) Computational Optimization and Applications , vol.12 , pp. 31-40
- Auslender, A.¹ Teboulle, M.² Ben-Tiba, S.³

3
- 0033358882
- Interior Proximal and Multiplier Methods based on Second Order Homogeneous Kernels
- Auslender A., Teboulle M., and Ben-Tiba S. Interior Proximal and Multiplier Methods based on Second Order Homogeneous Kernels. Mathematics of Operations Research 24 (1999) 645-668
- (1999) Mathematics of Operations Research , vol.24 , pp. 645-668
- Auslender, A.¹ Teboulle, M.² Ben-Tiba, S.³

4
- 0030246542
- On projection algorithms for solving convex feasibility problems
- Bauschke H.H., and Borwein J.M. On projection algorithms for solving convex feasibility problems. SIAM Review 38 (1996) 367-426
- (1996) SIAM Review , vol.38 , pp. 367-426
- Bauschke, H.H.¹ Borwein, J.M.²

5
- 21744459385
- Legendre functions and the method of random Bregman projections
- Bauschke H.H., and Borwein J.M. Legendre functions and the method of random Bregman projections. Journal of Convex Analysis 4 (1997) 27-67
- (1997) Journal of Convex Analysis , vol.4 , pp. 27-67
- Bauschke, H.H.¹ Borwein, J.M.²

6
- 0000424337
- A multiprojection algorithm using Bregman projections in a product space
- Censor Y., and Elfving T. A multiprojection algorithm using Bregman projections in a product space. Numerical Algorithms 8 (1994) 221-239
- (1994) Numerical Algorithms , vol.8 , pp. 221-239
- Censor, Y.¹ Elfving, T.²

7
- 0001054069
- Calcolo apprssimato per le soluzioni dei sistemi di equazioni lineari
- Cimmino G. Calcolo apprssimato per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica Roma 1 (1938) 326-333
- (1938) La Ricerca Scientifica Roma , vol.1 , pp. 326-333
- Cimmino, G.¹

8
- 0031148181
- Hilbertian convex feasibility problem: convergence and projection methods
- Combettes P.L. Hilbertian convex feasibility problem: convergence and projection methods. Applied Mathematics and Optimization 35 (1997) 311-330
- (1997) Applied Mathematics and Optimization , vol.35 , pp. 311-330
- Combettes, P.L.¹

9
- 0003630894
- SIAM Publications, Philadelphia, PA
- Nesterov Y., and Nemirovski A. Interior point polynomial algorithms in convex programming (1994), SIAM Publications, Philadelphia, PA
- (1994) Interior point polynomial algorithms in convex programming
- Nesterov, Y.¹ Nemirovski, A.²

10
- 85049776636
- Optimization Software Inc., New York
- Polyak B.T. Introduction to Optimization (1987), Optimization Software Inc., New York
- (1987) Introduction to Optimization
- Polyak, B.T.¹

11
- 0004267646
- Princeton University Press, Princeton, NJ
- Rockafellar R.T. Convex Analysis (1970), Princeton University Press, Princeton, NJ
- (1970) Convex Analysis
- Rockafellar, R.T.¹

12
- 0031285685
- Convergence of Proximal-like Algorithms
- Teboulle M. Convergence of Proximal-like Algorithms. SIAM J. of Optimization 7 (1997) 1069-1083
- (1997) SIAM J. of Optimization , vol.7 , pp. 1069-1083
- Teboulle, M.¹

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