Semidefinite programming and matrix scaling over the semidefinite cone

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

Semidefinite programming (SDP) and matrix scaling over the semidefinite cone were discussed. Real number model of computation the decision problem of testing the solvability of matrix scaling was presented. It was found that this algorithm can not only test the solvability of feasibility problem in SDP but also can test solvability of the matrix scaling method.

Original languageEnglish (US)
Pages (from-to)221-243
Number of pages23
JournalLinear Algebra and Its Applications
Volume375
Issue number1-3
DOIs
StatePublished - Dec 1 2003

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Keywords

  • Interior-point method
  • Matrix scaling
  • Newton's method
  • Positive semidefinite linear operators
  • Semidefinite programming

Fingerprint Dive into the research topics of 'Semidefinite programming and matrix scaling over the semidefinite cone'. Together they form a unique fingerprint.

  • Cite this