Discretization method for semi-definite programming

DOI10.1016/j.camwa.2004.02.010zbMath1079.90095OpenAlexW2008140051MaRDI QIDQ1770709

Qingzhi Yang, Yu Hong

Publication date: 7 April 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.02.010

zbMATH Keywords

DualitySemi-infinite programmingSemi-definite programmingOptimal division

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

A novel neural network for solving semidefinite programming problems with some applications

Cites Work

• Unnamed Item
• Unnamed Item
• A note on an implementation of a method for quadratic semi-infinite programming
• Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• An implementation of a discretization method for semi-infinite programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• Discretization in semi-infinite programming: the rate of convergence

This page was built for publication: Discretization method for semi-definite programming