Semidefinite programming and matrix scaling over the semidefinite cone.

DOI10.1016/S0024-3795(03)00664-5MaRDI QIDQ1414710zbMATH OpenWikidataFDO

Authors Bahman Kalantari

Publication date 4 December 2003

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Newton's methodInterior-point methodSemidefinite programmingMatrix scalingPositive semidefinite linear operators

Mathematics Subject Classification ID

Interior-point methods (90C51) Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Diagonal Matrix Scaling and Linear Programming
• scientific article; zbMATH DE number 1182565
• On the complexity of semidefinite programs
• Semidefinite Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 4197755 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• An exact duality theory for semidefinite programming and its complexity implications
• Barrier Functions in Interior Point Methods
• Diagonal Matrix Scaling and Linear Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On linear programming and matrix scaling over the algebraic numbers
• On the complexity of semidefinite programs
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Scaling of matrices to achieve specified row and column sums
• Scaling symmetric positive definite matrices to prescribed row sums.
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Semidefinite Programming

Cited in

(10)

• A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
• Semidefinite programming and arithmetic circuit evaluation
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
• Generating and measuring instances of hard semidefinite programs
• Diagonal Matrix Scaling and Linear Programming
• Diagonal matrix scaling is NP-hard
• On semidefinite programming characterizations of the numerical radius and its dual norm
• How Do Exponential Size Solutions Arise in Semidefinite Programming?
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
• A characterization theorem and an algorithm for a convex hull problem

This page was built for publication: Semidefinite programming and matrix scaling over the semidefinite cone.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414710)