Semidefinite programming and matrix scaling over the semidefinite cone.
type: Item
instance of: scholarly article
title: Semidefinite programming and matrix scaling over the semidefinite cone.
zbMATH Open document ID: 1076.90043
DOI: 10.1016/S0024-3795(03)00664-5
author: Bahman Kalantari
published in: Linear Algebra and its Applications
publication date: 2003-12-04T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 2013055
zbMATH Keywords: Semidefinite programming
zbMATH Keywords: Matrix scaling
zbMATH Keywords: Newton's method
zbMATH Keywords: Interior-point method
zbMATH Keywords: Positive semidefinite linear operators
Wikidata QID: Q114850258
MaRDI profile type: Publication
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Initialization in semidefinite programming via a self-dual skew-symmetric embedding
cites work: Q4321748
cites work: Barrier Functions in Interior Point Methods
cites work: Q5202848
cites work: A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
cites work: On linear programming and matrix scaling over the algebraic numbers
cites work: A new polynomial-time algorithm for linear programming
cites work: Diagonal Matrix Scaling and Linear Programming
cites work: Scaling of matrices to achieve specified row and column sums
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Scaling symmetric positive definite matrices to prescribed row sums.
cites work: On the complexity of semidefinite programs
cites work: An exact duality theory for semidefinite programming and its complexity implications
cites work: Semidefinite Programming
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
description: scientific article; zbMATH DE number 2013055