SCOPUS 정보 검색 플랫폼

Computational and Applied Mathematics

Volumn 25, Issue 1, 2006, Pages 97-110

A new primal-dual path-following method for convex quadratic programming

(1) Achache, Mohamed a

a FERHAT ABBAS UNIVERSITY (Algeria)

Author keywords

Convergence of algorithms; Convex quadratic programming; Interior point methods; Primal dual path following methods

Indexed keywords

POLYNOMIAL APPROXIMATION; QUADRATIC PROGRAMMING;

CONVERGENCE OF ALGORITHM; CONVEX QUADRATIC PROGRAMMING; DUAL PATH; INTERIOR-POINT METHOD; LINEAR PROGRAMS; PATH-FOLLOWING METHOD; PRIMAL-DUAL; PRIMAL-DUAL PATH-FOLLOWING METHOD; QUADRATIC PROGRAMS; SEARCH DIRECTION;

LINEAR PROGRAMMING;

EID: 33749517344 PISSN: 22383603 EISSN: 18070302 Source Type: Journal
DOI: 10.1590/S0101-82052006000100005 Document Type: Article

Times cited : (68)

References (8)

1
- 0024665753
- Interior path following primal-dual algorithms, Part II: Convex quadratic programming
- L. Adler and R.D.C. Monteiro, Interior path following primal-dual algorithms, Part II: Convex quadratic programming. Mathematical Programming, 44 (1989), 43-66.
- (1989) Mathematical Programming , vol.44 , pp. 43-66
- Adler, L.¹ Monteiro, R.D.C.²

2
- 2342458706
- Second-order cone programming
- F. Alizadeh and D. Goldfarb, Second-order cone programming. Mathematical programming, 95 (2003), 3-15.
- (2003) Mathematical Programming , vol.95 , pp. 3-15
- Alizadeh, F.¹ Goldfarb, D.²

3
- 0342464718
- A long step barrier method for convex quadratic programming
- Delft University of technology. Report
- K.M. Anstreicher, D. den hertog, C. Roos and T. Terlaky, A long step barrier method for convex quadratic programming. Delft University of technology. Report, (1990), 90-53.
- (1990) , pp. 53-90
- Anstreicher, K.M.¹ den hertog, D.² Roos, C.³ Terlaky, T.⁴

4
- 0042158444
- A new efficient large-update primal-dual interior-point method based on a finite barrier
- Y.Q. Bai, M. El ghami and C. Roos, A new efficient large-update primal-dual interior-point method based on a finite barrier. SIAM Journal on Optimization, 13(3) (2003), 766-782.
- (2003) SIAM Journal on Optimization , vol.13 , Issue.3 , pp. 766-782
- Bai, Y.Q.¹ El ghami, M.² Roos, C.³

5
- 0003878614
- of MPS-SIAM Series on Optimization. SIAM, Philadelphia, USA
- A. Ben-Tal and A. Nemirovski, Lectures on Modern convex Optimization. Analysis, Algorithms and engineering Applications, volume 2 of MPS-SIAM Series on Optimization. SIAM, Philadelphia, USA (2001).
- (2001) Lectures on Modern Convex Optimization. Analysis, Algorithms and Engineering Applications , vol.2
- Ben-Tal, A.¹ Nemirovski, A.²

6
- 29144468786
- A new algorithm for solving self-dual linear programming problems
- Series Informatica
- Zs. Darvay, A new algorithm for solving self-dual linear programming problems. Studia Universitatis Babes-Bolyai, Series Informatica, 47(1) (2002), 15-26.
- (2002) Studia Universitatis Babes-Bolyai , vol.47 , Issue.1 , pp. 15-26
- Darvay, Zs.¹

7
- 0037288631
- Primal-dual interior point methods for second-order conic optimization based on self-regular proximities
- J. Peng, C. Roos and T. Terlaky, Primal-dual interior point methods for second-order conic optimization based on self-regular proximities. SIAM J. Optimization, 13(1) (2002), 179-203.
- (2002) SIAM J. Optimization , vol.13 , Issue.1 , pp. 179-203
- Peng, J.¹ Roos, C.² Terlaky, T.³

8
- 0003459671
- SIAM, Philadelphia, USA
- S.J. Wright. Primal-Dual Interior Point Methods. SIAM, Philadelphia, (1997), USA.
- (1997) Primal-Dual Interior Point Methods
- Wright, S.J.¹

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