Open Access
Linear Algebra for Semidefinite Programming
Masakazu Kojima,Sadayoshi Kojima,Shinji Hara +2 more
- 01 Jun 1997
- Vol. 1004, Iss: 1004, pp 1-23
About: The article was published on 01 Jun 1997. and is currently open access. The article focuses on the topics: Quadratically constrained quadratic program & Semidefinite programming.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Numerical Algorithm for Block-Diagonal Decomposition of Matrix ⁄-Algebras ⁄
Kazuo Murota,Yoshihiro Kanno,Masakazu Kojima,Sadayoshi +3 more
- 01 Jan 2007
TL;DR: In this paper, the authors propose a numerical method for finding a finest simultaneous block-diagonalization of a finite number of symmetric matrices, or equivalently the irreducible decomposition of the matrix ⁄-algebra generated by symmetric matrix.
Semidefinite programming for discrete optimization and matrix completion problems
Henry Wolkowicz,Miguel F. Anjos +1 more
TL;DR: A recipe for finding SDP relaxations based on adding redundant constraints and using Lagrangian relaxation is presented and a new application of SDP to find approximate matrix completions for large and sparse instances of Euclidean distance matrices is concluded.
44
Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp ∗
TL;DR: In this paper, a family of primal/primal-dual/dual search directions for the monotone LCP over the space of n× nsymmetric block-diagonal matrices is considered.
34
•Dissertation
New Approaches to Protein NMR Automation
Babak Alipanahi Ramandi
- 16 Nov 2011
TL;DR: In this paper, a semidefinite programming-based (SDP) method is proposed for protein NMR, which can efficiently determine the structures of moderate sized proteins without human intervention.
8
•Posted Content
Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs
TL;DR: This work considers both facial reduction, FR, and symmetry reduction, SR, techniques for semidefinite programming, SDP, and shows that the combination of FR and SR leads to a significant improvement in both numerical stability and running time for both the ADMM and interior point approaches.
References
Linear programming with matrix variables
B. D. Craven,Bertram Mond +1 more
TL;DR: The duality theorems for linear programming over complex spaces, and over quaternion spaces, follow as special cases as discussed by the authors, with the inner product defined using trace of a matrix.
17
Related Papers (5)
Michael L. Overton,Henry Wolkowicz +1 more
- 01 Apr 1997
Leander Quiring
- 01 Jan 2008
Caroline Margaret Johnston
- 24 Apr 2019
E. de Klerk
- 01 Jan 2002
Brian Borchers
- 01 Jan 1999