Please use this identifier to cite or link to this item:
|Title:||Invariance and efficiency of convex representations||Authors:||Chua, Chek Beng.
|Keywords:||DRNTU::Science::Mathematics::Applied mathematics::Optimization||Issue Date:||2006||Source:||Chua, C. B., & Tunçel, L. (2006). Invariance and efficiency of convex representations. Mathematical Programming, 113-140.||Series/Report no.:||Mathematical programming||Abstract:||We consider two notions for the representations of convex cones: G-representation and lifted-G-representation. The former represents a convex cone as a slice of another; the latter allows in addition, the usage of auxiliary variables in the representation.We first study the basic properties of these representations. We show that some basic properties of convex cones are invariant under one notion of representation but not the other. In particular, we prove that lifted-G-representation is closed under duality when the representing cone is self-dual.We also prove that strict mplementarity of a convex optimization problem in conic form is preserved under G-representations. Then we move to study efficiency measures for representations.We evaluate the representations of homogeneous convex cones based on the “smoothness” of the transformations mapping the central path of the representation to the central path of the represented optimization problem.||URI:||https://hdl.handle.net/10356/91764
|ISSN:||0025-5610||DOI:||10.1007/s10107-006-0072-6||Rights:||Mathematical Programming @ copyright 2006 Springer-Verlag. The journal's website is located at http://www.springerlink.com.ezlibproxy1.ntu.edu.sg/content/103081.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.