scientific article; zbMATH DE number 2246591
zbMATH Open1098.90089MaRDI QIDQ5717954FDOQ5717954
Authors: Kartik Krishnan, Tamás Terlaky 
Publication date: 13 January 2006
Title of this publication is not available (Why is that?)
Recommendations
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- scientific article; zbMATH DE number 1302172
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- scientific article; zbMATH DE number 1031414
- Semidefinite programming and combinatorial optimization
linear programmingcombinatorial optimizationsemidefinite programmingapproximation algorithmsbranch and cut
Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Interior-point methods (90C51) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (10)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A matrix generation approach for eigenvalue optimization
- Matrix relaxations in combinatorial optimization
- Scalable Semidefinite Programming
- Strong duality and minimal representations for cone optimization
- Topics in semidefinite and interior-point methods
- Title not available (Why is that?)
- Coarray interpolation for joint DOD and DOA estimation in bistatic coprime MIMO radar via decoupled atomic norm minimization
- Title not available (Why is that?)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
Uses Software
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 Q5717954)
