scientific article; zbMATH DE number 6135091

MaRDI QIDQ4906149zbMATH OpenFDO

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

zbMATH Keywords

interior point methodssemidefinite programmingmaximum eigenvalue functioncone of tangentsregularized cutting plane algorithms

Mathematics Subject Classification ID

Convex programming (90C25) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

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

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
• scientific article; zbMATH DE number 2196287 (Why is no real title available?)
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• scientific article; zbMATH DE number 1182577 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• SBmethod
• SDPARA
• SDPLR
• CSDP

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)