Semidefinite programming and matrix scaling over the semidefinite cone

Research output: Contribution to journalArticle

3 Citations (Scopus)

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

Fingerprint

Semidefinite Programming
Solvability
Cones
Cone
Scaling
Models of Computation
Decision problem
Testing

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

Cite this

@article{3a79e30107f34e26a5bf146722449292,
title = "Semidefinite programming and matrix scaling over the semidefinite cone",
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.",
keywords = "Interior-point method, Matrix scaling, Newton's method, Positive semidefinite linear operators, Semidefinite programming",
author = "Bahman Kalantari",
year = "2003",
month = "12",
day = "1",
doi = "10.1016/S0024-3795(03)00664-5",
language = "English (US)",
volume = "375",
pages = "221--243",
journal = "Linear Algebra and Its Applications",
issn = "0024-3795",
publisher = "Elsevier Inc.",
number = "1-3",

}

Semidefinite programming and matrix scaling over the semidefinite cone. / Kalantari, Bahman.

In: Linear Algebra and Its Applications, Vol. 375, No. 1-3, 01.12.2003, p. 221-243.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Semidefinite programming and matrix scaling over the semidefinite cone

AU - Kalantari, Bahman

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

KW - Interior-point method

KW - Matrix scaling

KW - Newton's method

KW - Positive semidefinite linear operators

KW - Semidefinite programming

UR - http://www.scopus.com/inward/record.url?scp=0142030950&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142030950&partnerID=8YFLogxK

U2 - 10.1016/S0024-3795(03)00664-5

DO - 10.1016/S0024-3795(03)00664-5

M3 - Article

AN - SCOPUS:0142030950

VL - 375

SP - 221

EP - 243

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

SN - 0024-3795

IS - 1-3

ER -