scientific article; zbMATH DE number 1182565

zbMATH Open0906.90123MaRDI QIDQ4400635FDOQ4400635

Authors: Lorant Porkolab, Leonid G. Khachiyan 

Publication date: 2 August 1998

Title of this publication is not available (Why is that?)

Recommendations

• On the complexity of semidefinite programs
• Semidefinite programming and matrix scaling over the semidefinite cone.
• An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
• On the feasibility problem of linear matrix inequalities

zbMATH Keywords

conesemidefinite feasibility problem

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (7)

• Semidefinite programming for the educational testing problem
• Semidefinite programming and matrix scaling over the semidefinite cone.
• Title not available (Why is that?)
• A copositivity probe
• SDPLIB 1.2, a library of semidefinite programming test problems
• A procedure of Chvátal for testing feasibility in linear programming and matrix scaling
• Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication:

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