Solving semidefinite programs via discretization method for solving semiinfinite programming problems

DOI10.11721/CQNUJ20180202MaRDI QIDQ5381448zbMATH OpenFDO

Authors Mingxiao Xi, Honglin Luo

Publication date 21 June 2019

Full work available at URL https://doi.org/10.11721/CQNUJ20180202

zbMATH Keywords

discretization methodsemidefinite programssemiinfinite programming problemsstrong duality theorem

Mathematics Subject Classification ID

Linear programming (90C05) Semidefinite programming (90C22) Semi-infinite programming (90C34) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Discretization method for semi-definite programming
• On solving a class of linear semi-infinite programming by SDP method
• A new proof of the strong duality theorem for semidefinite programming
• A solution method for combined semi-infinite and semi-definite programming
• Solving semidefinite programming problems via alternating direction methods

Cited in

(7)

• Discretization methods for the solution of semi-infinite programming problems
• Discretization method for semi-definite programming
• A new proof of the strong duality theorem for semidefinite programming
• scientific article; zbMATH DE number 3926631 (Why is no real title available?)
• A solution method for combined semi-infinite and semi-definite programming
• On solving a class of linear semi-infinite programming by SDP method
• Semidefinite relaxations of dynamical programs under discrete constraints

This page was built for publication: Solving semidefinite programs via discretization method for solving semiinfinite programming problems

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