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

DOI10.1155/2012/946893zbMath1254.90155OpenAlexW2068510380WikidataQ58906983 ScholiaQ58906983MaRDI QIDQ1760902

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

zbMATH Keywords

interior point methodsemidefinite programs

Mathematics Subject Classification ID

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

Related Items (1)

Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method

Uses Software

• SDPLIB
• SDPT3
• Sp

Cites Work

• A polynomial-time algorithm, based on Newton's method, for linear programming
• Newton's method for convex programming and Tschebyscheff approximation
• Applications of semidefinite programming
• 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
• Outline of an algorithm for integer solutions to linear programs
• The Cutting-Plane Method for Solving Convex Programs
• SDPLIB 1.2, a library of semidefinite programming test problems
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• A New Notion of Weighted Centers for Semidefinite Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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