The Geometry of Cone-lp's
The Geometry of Cone-lp's
复制标题
Cone-lp 的几何形状
DOI:
--
复制
发表时间:
--
期刊:
影响因子:
--
通讯作者:
G. Abor Pataki
中科院分区:
文献类型:
--
作者:
G. Abor Pataki
Given the conic formulation of a convex program, we describe a theory that Characterizes the faces of the feasible sets. Deenes nondegeneracy, strict complementarity and relates these to the optimal face, analogously to the LP case. Characterizes the tangent spaces of the feasible sets. Introduces the family of boundary structure inequalities which relate the dimensions of the above-mentioned sets. Using the general framework, gives a simple derivation for a number of structural results about problems that can be formulated as an SDP. Shows how two algorithmic aspects can be handled: converting a feasible solution into one, which is also an extreme point; and performing a restricted sensitivity analysis.