Abstract
In this paper, we study Lagrangian duality aspects in convex conic programming over general convex cones. It is known that the duality in convex optimization is linked with specific theorems of alternatives. We formulate and prove the strong alternative theorems to the strict feasibility and analyze the relation between the boundedness of the optimal solution sets and the existence of the relative interior points in the feasible set. We also provide sufficient conditions under which the duality gap is zero and the optimal solution sets are unbounded. As a consequence, we obtain several new sufficient conditions that guarantee the strong duality between primal and dual convex conic programs. Our proofs are based only on fundamental convex analysis and linear algebra results.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
