An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers

DOI10.1155/2012/946893MaRDI QIDQ1760902zbMATH OpenOpenAlexWikidataFDO

Authors John Machacek, Shafiu Jibrin

Publication date 15 November 2012

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/946893

zbMATH Keywords

interior point methodsemidefinite programs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Interior-point methods (90C51) Semidefinite programming (90C22)

Recommendations

• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• scientific article; zbMATH DE number 6135091
• A unifying framework for several cutting plane methods for semidefinite programming
• An Interior-Point Method for Semidefinite Programming
• A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

Cites work

• scientific article; zbMATH DE number 2107691 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A New Notion of Weighted Centers for Semidefinite Programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A weighted analytic center for linear matrix inequalities
• Applications of semidefinite programming
• Feasibility and constraint analysis of sets of linear matrix inequalities
• Improving solver success in reaching feasibility for sets of nonlinear constraints
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Newton's method for convex programming and Tschebyscheff approximation
• Outline of an algorithm for integer solutions to linear programs
• SDPLIB 1.2, a library of semidefinite programming test problems
• Semidefinite Programming
• The Cutting-Plane Method for Solving Convex Programs
• The constraint consensus method for finding approximately feasible points in nonlinear programs

Cited in

(3)

• Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

Describes a project that uses

Uses Software

• Sp
• SDPT3
• SDPLIB

This page was built for publication: An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers

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