scientific article; zbMATH DE number 6135091
zbMATH Open1264.90136MaRDI QIDQ4906149FDOQ4906149
Authors: Kartik Krishnan Sivaramakrishnan, John E. Mitchell 
Publication date: 7 February 2013
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol8/p779.html
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1182577
- A unifying framework for several cutting plane methods for semidefinite programming
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- scientific article; zbMATH DE number 2196287
- scientific article; zbMATH DE number 1757960
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- A cutting-plane method for quadratic semi infinite programming problems
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- On the cutting plane property and the Bregman proximal point algorithm
interior point methodssemidefinite programmingmaximum eigenvalue functioncone of tangentsregularized cutting plane algorithms
Convex programming (90C25) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)
Cited In (12)
- A unifying framework for several cutting plane methods for semidefinite programming
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
- Title not available (Why is that?)
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- Title not available (Why is that?)
- A cutting plane method for solving KYP-SDPs
- A relaxed cutting plane method for semi-infinite semi-definite programming
- A copositive framework for analysis of hybrid Ising-classical algorithms
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 Q4906149)
