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

DOI10.1155/2012/946893zbMATH Open1254.90155OpenAlexW2068510380WikidataQ58906983 ScholiaQ58906983MaRDI QIDQ1760902FDOQ1760902

Authors: John Machacek, Shafiu Jibrin 

Publication date: 15 November 2012

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

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

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

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)

Cites Work

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

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

Uses Software

• SDPLIB
• SDPT3
• Sp

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)