Infeasible interior point method for semidefinite programs

MaRDI QIDQ5422884zbMATH OpenFDO

Authors

Publication date 30 October 2007

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Interior-point methods (90C51)

Recommendations

• Semidefinite Programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

Cited in

(18)

• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• Irreducible infeasible subsystems of semidefinite systems
• Embedding methods for semidefinite programming
• Bad semidefinite programs: they all look the same
• Counterexample to a Conjecture on an Infeasible Interior-Point Method
• On homogeneous interrior-point algorithms for semidefinite programming
• scientific article; zbMATH DE number 1985305 (Why is no real title available?)
• scientific article; zbMATH DE number 1746424 (Why is no real title available?)
• A numerical feasible interior point method for linear semidefinite programs
• A full NT-step infeasible interior-point algorithm for semidefinite optimization
• scientific article; zbMATH DE number 1372695 (Why is no real title available?)
• An Interior-Point Method for Semidefinite Programming
• Infeasible potential reduction algorithms for semidefinite programming
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems
• A primal-dual infeasible interior point algorithm for semidefinite programming
• Computational experience with ill-posed problems in semidefinite programming
• Polynomial time solvability of non-symmetric semidefinite programming

This page was built for publication: Infeasible interior point method for semidefinite programs

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