SCOPUS 정보 검색 플랫폼

Mathematical Programming

Volumn 69, Issue 1-3, 1995, Pages 205-236

A primal-dual potential reduction method for problems involving matrix inequalities

(2) Vandenberghe, Lieven a Boyd, Stephen b

a UNIVERSITY OF LEUVEN (Belgium)

b STANFORD UNIVERSITY (United States)

Author keywords

Interior point algorithms; Linear matrix inequalities; Semidefinite programming

Indexed keywords

EID: 0006505636 PISSN: 00255610 EISSN: 14364646 Source Type: Journal
DOI: 10.1007/BF01585558 Document Type: Article

Times cited : (41)

References (36)

1
- 0000110392
- An implementation of Karmarkar's algorithm for linear programming
- (1989) Mathematical Programming , vol.44 , pp. 297-335
- Adler, I.¹ Resende, M.G.C.² Veiga, G.³ Karmarkar, N.⁴

2
- 84936461742
- F. Alizadeh, “Combinatorial optimization with interior point methods and semi-definite matrices,” Ph.D. Thesis, Univ. Minnesota, 1991.

3
- 0002433203
- Optimization over the positive-definite cone: interior point methods and combinatorial applications
- P., Pardalos, North-Holland, Amsterdam
- (1992) Advances in Optimization and Parallel Computing
- Alizadeh, F.¹

4
- 34249927749
- A combined phase I-phase II scaled potential algorithm for linear programming
- (1991) Mathematical Programming , vol.52 , pp. 429-439
- Anstreicher, K.M.¹

5
- 0021618667
- Generalized eigenproblem algorithms and software for algebraic Riccati equations
- (1984) Proceedings of the IEEE , vol.72 , pp. 1746-1754
- Arnold, W.F.¹ Laub, A.J.²

6
- 0013201951
- On systems of linear inequalities in Hermitian matrix variables
- V.L., Klee, American Mathematical Society, Providence, RI
- (1963) Convexity, Proceedings of Symposia in Pure Mathematics 7 , pp. 1-11
- Bellman, R.¹ Fan, K.²

7
- 84936461731
- A. Ben Tal and A. Nemirovskii, “Interior point polynomial time methods for truss topology design,” Technical Report 3/92, Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, 1992.

8
- 43949163936
- Method of centers for minimizing generalized eigenvalues
- (1993) Linear Algebra and its Applications , vol.188 , pp. 63-111
- Boyd, S.¹ El Ghaoui, L.²

9
- 0003595806
- Studies in Applied Mathematics, 15, SIAM, Philadelphia, PA
- (1994) Linear Matrix Inequalities in System and Control Theory
- Boyd, S.¹ El Ghaoui, L.² Feron, E.³ Balakrishnan, V.⁴

10
- 0002830663
- A large-step analytic center method for a class of smooth convex programming problems
- (1992) SIAM Journal on Optimization , vol.2 , pp. 55-70
- Den Hertog, D.¹ Roos, C.² Terlaky, T.³

11
- 0000754239
- Iterative solution of problems of linear and quadratic programming
- (1967) Soviet Mathematics Doklady , vol.8 , pp. 674-675
- Dikin, I.¹

12
- 0000781036
- A nonlinear programming problem in statistics (educational testing)
- (1981) SIAM Journal on Scientific and Statistical Computing , vol.2 , pp. 257-267
- Fletcher, R.¹

13
- 0021459322
- Semidefinite matrix constraints in optimization
- (1985) SIAM Journal on Control and Optimization , vol.23 , pp. 493-513
- Fletcher, R.¹

14
- 29344449677
- A potential-function reduction algorithm for solving a linear program directly from an infeasible warm start
- (1991) Mathematical Programming , vol.52 , pp. 441-466
- Freund, R.M.¹

15
- 0026874674
- Solution of the Sylvester matrix equation AXB^T+ CXD^T= E
- (1992) ACM Transactions on Mathematical Software , vol.18 , pp. 223-231
- Gardiner, J.D.¹ Laub, A.J.² Amato, J.J.³ Moler, C.B.⁴

16
- 0022808235
- On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method
- (1986) Mathematical Programming Studies , vol.36 , pp. 183-209
- Gill, P.E.¹ Murray, W.² Saunders, M.A.³ Tomlin, J.A.⁴ Wright, M.H.⁵

17
- 34250094734
- A relaxed version of Karmarkar's method
- (1988) Mathematical Programming , vol.40 , pp. 289-315
- Goldfarb, D.¹ Mehrotra, S.²

18
- 84892316981
- A self-correcting version of Karmarkar's algorithm
- (1989) SIAM Journal on Numerical Analysis , vol.26 , pp. 1006-1015
- Goldfarb, D.¹ Mehrotra, S.²

19
- 0004236492
- Johns Hopkins Univ. Press, Baltimore, MD
- (1989) Matrix Computations
- Golub, G.¹ Van Loan, C.²

20
- 0018721357
- A Hessenberg-Schur method for the matrix problem AX+XB=C
- (1979) IEEE Transactions on Automatic Control , vol.24 , pp. 909-913
- Golub, G.¹ Nash, S.² Van Loan, C.³

21
- 0026876871
- Path-following methods for linear programming
- (1992) SIAM Review , vol.34 , pp. 167-224
- Gonzaga, C.C.¹

22
- 0042407113
- AnO(nL)-iteration large-step primal-dual affine algorithm for linear programming
- (1992) SIAM Journal on Optimization , vol.2 , pp. 349-359
- Gonzaga, C.C.¹ Todd, M.J.²

23
- 0003957164
- Algorithms and Combinatorics, 2, Springer, Berlin
- (1988) Geometric Algorithms and Combinatorial Optimization
- Grötschel, M.¹ Lovász, L.² Schrijver, A.³

24
- 0027656654
- An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices
- (1993) SIAM Journal on Control and Optimization , vol.31 , pp. 1360-1377
- Jarre, F.¹

25
- 84936461732
- K. Kim and J.L. Nazareth, “Implementation of a primal null-space affine scaling method and its extensions,” Technical Report, Department of Pure and Applied Mathematics, Washington State Univ., 1992.

26
- 9744257292
- Feasibility issues in a primal-dual interior-point method for linear programming
- (1991) Mathematical Programming , vol.49 , pp. 145-162
- Lustig, I.J.¹

27
- 0026838079
- Implementations of affine scaling methods: approximate solutions of systems of linear equations using preconditioned conjugate gradient methods
- (1992) ORSA Journal on Computing , vol.4 , pp. 103-118
- Mehrotra, S.¹

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

29
- 0003916952
- USSR Acad. Sci. Center. Econ. & Math. Inst., Moscow
- (1990) Optimization over Positive Semidefinite Matrices: Mathematical Background and User's Manual
- Nesterov¹ Nemirovsky, A.²

30
- 0003630894
- Studies in Applied Mathematics, 13, SIAM, Philadelphia, PA
- (1994) Interior-point Polynomial Methods in Convex Programming
- Nesterov¹ Nemirovsky, A.²

31
- 0001110772
- On minimizing the maximum eigenvalue of a symmetric matrix
- (1988) SIAM Journal on Matrix Analysis and Applications , vol.9 , pp. 256-268
- Overton, M.¹

32
- 0003181133
- Large-scale optimization of eigenvalues
- (1992) SIAM Journal on Optimization , vol.2 , pp. 88-120
- Overton, M.¹

33
- 0039943513
- LSQR: An algorithm for sparse linear equations and sparse least squares
- (1982) ACM Transactions on Mathematical Software , vol.8 , pp. 43-71
- Paige, C.C.¹ Saunders, M.S.²

34
- 84936461729
- J.-P. Vial, “Computational experience with a primal-dual interior-point method for smooth convex programming,” Technical Report, Département d'Économie Commerciale et Industrielle, Univ. Genève, 1992.

35
- 21144476700
- Algorithms for minimum trace factor analysis
- (1992) SIAM Journal on Matrix Analysis and Applications , vol.13 , pp. 1039-1053
- Watson, G.A.¹

36
- 30244531730
- An O(n³L) potential reduction algorithm for linear programming
- (1991) Mathematical Programming , vol.50 , pp. 239-258
- Ye, Y.¹

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