Abstract
AbstractThere recently has been much interest in studying some optimization problems over symmetric cones. In this paper, we discuss the Lagrange dual theory of tonlinear symmetric cone programming, including the weak duality theorem, the strong duality theorem, and the saddle point theorem.KeywordsNonlinear symmetric cone programmingweak duality theoremstrong dualitysaddle point theorem
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
