Showing 1 - 7 of 7
In this paper we present penalty and barrier methods for solving general convex semidefinite programming problems. More precisely, the constraint set is described by a convex operator that takes its values in the cone of negative semidefinite symmetric matrices. This class of methods is an...
Persistent link: https://www.econbiz.de/10010847728
In this paper we present penalty and barrier methods for solving general convex semidefinite programming problems. More precisely, the constraint set is described by a convex operator that takes its values in the cone of negative semidefinite symmetric matrices. This class of methods is an...
Persistent link: https://www.econbiz.de/10010950142
Persistent link: https://www.econbiz.de/10008255210
Persistent link: https://www.econbiz.de/10006419500
Persistent link: https://www.econbiz.de/10006420454
Persistent link: https://www.econbiz.de/10007258569
Persistent link: https://www.econbiz.de/10009585282