Masakazu Kojima, Sadayoshi Kojima, Shinji Hara  Home/Search
Context Related
| is.titech.ac.jp/labs/kojim...b290.ps.Z www2.is.titech.ac.jp/~koji...b290.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: is.titech.ac.jp/labs/kojima...sdp (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Let M n (IK) denote the set of all n 2 n matrices with elements in IK, where IK represents the field IR of real numbers, the field 0 C of complex numbers or the (noncommutative) field IH of quaternion numbers. We call a subset T of M n (IK) a *-subalgebra of M n (IK) over the field IR (or simply a *-subalgebra) if (i) T forms a subring of M n (IK) with the usual addition A + B and multiplication AB of matrices A; B 2 M n (IK); specifically the zero matrix O and the identity matrix I belong... (Update)
Context of citations to this paper: More
.... are Craven and Mond [CM81] Shapiro [Sha85] Fletcher [Fle85] Allwright [All88] Wolkowicz [Wol81] and Kojima, Kojima and Hara [KKH94]. Many researchers have worked on the problem of minimizing the maximum eigenvalue of a symmetric matrix, which can be cast as a...
...(1. 3) For a survey of results obtained before 1993 in this field see the paper of Alizadeh [1] More recent results can be found in [4, 2, 3, 7, 9, 16]. This work was supported in part by NSF Grant DMS 9305760. y Department of Mathematics, The University of Iowa, Iowa City, IA...
Cited by: More
Semidefinite Programming - Vandenberghe, Boyd (1995) (Correct)
Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
A Superlinearly Convergent Primal-Dual.. - Potra, Sheng (1995) (Correct)
Active bibliography (related documents): More All
0.2: An Interior Point Potential Reduction Method for.. - Wang, Monteiro, Pang (1995) (Correct)
0.2: Theoretical Convergence of Large-Step Primal-Dual.. - Kojima, Megiddo, Mizuno (1992) (Correct)
0.2: Convex Optimization: Barrier Functions And Interior-Point Methods - Tunçel (1998) (Correct)
Similar documents based on text: More All
0.5: Polynomiality of Primal-Dual Algorithms for Semidefinite.. - Monteiro, Tsuchiya (1997) (Correct)
0.5: Search Directions in the SDP and the Monotone SDLCP.. - Kojima (1997) (Correct)
0.5: Superlinear Convergence of Interior-Point Algorithms for.. - Potra, Sheng (1996) (Correct)
Related documents from co-citation: More All
8: Interior point methods in semidefinite programming with applications to combinat.. - ALIZADEH - 1995
7: An interior-- point method for semidefinite programming - Helmberg, Rendl et al. - 1996
7: Primal-dual interior-point methods for semidefinite programming - Alizadeh, Haeberly et al. - 1994
BibTeX entry: (Update)
M. Kojima, S. Kojima, and S. Hara. Linear algebra for semidefinite programming. Research Reports on Information Sciences B-290, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, October 1994. http://citeseer.ist.psu.edu/kojima95linear.html More
@techreport{ kojima97linear,
author = "M. {KOJIMA} and S. {KOJIMA} and S. {HARA}",
title = "Linear algebra for semidefinite programming",
journal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
number = "1004",
address = "Tokyo Institute of Technology, Tokyo, Japan",
pages = "1--23",
year = "1997",
url = "citeseer.ist.psu.edu/kojima95linear.html" }
Citations (may not include all citations):529 Linear Matrix Inequalities in System and Control Theory (context) - Boyd, Ghaoui et al. - 1994
307 Interior Point Polynomial Methods in Convex Programming: The.. (context) - Nesterov, Nemirovskii - 1993
267 The Linear Complementarity Problem (context) - Cottle, Pang et al. - 1992
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
146 Primal-dual interior-point methods for semidefinite programm.. - Alizadeh, Haeberly et al. - 1994
140 Interior path following primal-dual algorithms. Part I: Line.. (context) - Monteiro, Adler - 1989
140 Interior path following primal-dual algorithms. Part II: Con.. (context) - Monteiro, Adler - 1989
116 A Unified Approach to Interior Point Algorithms for Linear C.. - Kojima, Megiddo et al. - 1991
101 Pathways to the optimal set in linear programming (context) - Megiddo - 1989
90 A primal-dual potential reduction method for problems involv.. - Vandenberghe, Boyd - 1995
85 A primal-dual interior point algorithm for linear programmin.. (context) - Kojima, Mizuno et al. - 1989
73 A polynomial-time algorithm for a class of linear complement.. (context) - Kojima, Mizuno et al. - 1989
62 Computational experience with a primaldual interior-point me.. (context) - Lustig, Marsten et al. - 1991
56 Princeton University Press (context) - Weyl, Groups - 1946
28 A collection of robust control problems leading to LMI's (context) - Packard, Zhou et al. - 1991
28 Barrier functions in interior point methods - Guler - 1994
25 Self-scaled cones and interior-point methods in nonlinear pr.. - Nesterov, Todd - 1994
19 Infeasible-interior-point primal-dual potentialreduction alg.. - Mizuno, Kojima et al. - 1995
19 Centered Newton method for mathematical programming (context) - Tanabe - 1988
14 Interior point methods for linear programming: Just call New.. (context) - Marsten, Subramanian et al. - 1990
13 General Theory of Banach Algebras (context) - Rickart - 1960
12 Interior point methods for nonlinear complementarity problem.. (context) - Potra, Ye - 1991
12 An O( p nL) iteration potential reduction algorithm for line.. (context) - Kojima, Mizuno et al. - 1991
11 the convergence of an infeasible interior-point algorithm fo.. (context) - Zhang - 1994
11 Linear programming with matrix variables (context) - Craven, Mond - 1981
1 A polynomial algorithm for convex programming problems satis.. (context) - Kortanek, Zhu - 1990
1 Taishougun to ippan senkeigun no hyougenron (context) - Iwahori - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.is.titech.ac.jp/labs/kojimalab/kojima/sdp.html): More
Branch-and-Cut Algorithms for the Bilinear Matrix Inequality.. - Fukuda, al. (1999) (Correct)
On the Finite Convergence of Successive SDP Relaxation Methods - Kojima, al. (1999) (Correct)
Monotone Semidefinite Complementarity Problems - Shida, Shindoh (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC