On duality theory for non-convex semidefinite programming

Wenyu Sun (), Chengjin Li () and Raimundo Sampaio ()

Annals of Operations Research, 2011, vol. 186, issue 1, 343 pages

Abstract: In this paper, with the help of convex-like function, we discuss the duality theory for nonconvex semidefinite programming. Our contributions are: duality theory for the general nonconvex semidefinite programming when Slater’s condition holds; perfect duality for a special case of the nonconvex semidefinite programming for which Slater’s condition fails. We point out that the results of Fan (Appl. Math. Lett. 18:1068–1073, 2005 ) can be regarded as a special case of our result. Copyright Springer Science+Business Media, LLC 2011

Keywords: Semidefinite programming; Nonconvex semidefinite programming; Duality; Convex-like function; Invex function (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-0861-z (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:186:y:2011:i:1:p:331-343:10.1007/s10479-011-0861-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-0861-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().