节点文献

对称锥优化问题的扰动分析

Perturbation Analysis of Optimization Problems over Symmetric Cones

【作者】 王韵

【导师】 张立卫;

【作者基本信息】 大连理工大学 , 运筹学与控制论, 2008, 博士

【摘要】 本论文主要建立对称锥的变分分析并给出对称锥优化问题扰动分析的理论结果,主要内容可概括如下:1.第2章基于欧氏Jordan代数的性质,研究了对称锥的变分性质。首先推导了对称锥上投影算子B-次微分的计算公式以及对称锥的切锥、二阶切集的表达式。然后定义了对称锥上的线性-二次函数,建立了线性-二次函数与对称锥二阶切集的支撑函数的关系。2.第3章在前一章研究的基础上,阐述了对称锥优化问题的扰动理论结果。首先证明了对称锥具有外二阶正则性,从而给出对称锥优化问题无间隙的二阶最优性条件。其次引入对称锥优化问题两种形式的强二阶充分性条件,其中之一通过一线性-二次函数定义,另一个用二阶切集的支撑函数定义。之后,对于上述两种强二阶充分条件重合的非凸对称锥优化问题,得到了下述条件的等价性:约束非退化条件下的强二阶充分条件,KKT条件对应的广义方程的解的强正则性,KKT条件对应的非光滑映射(简称KKT映射)的Clarke广义微分的非奇异性,优化问题局部最优解的强稳定性,以及其他4条结论相互等价。特别地,对于凸对称锥优化问题,不需要任何假设,上述9条性质均等价,且等价于KKT映射的B-次微分的非奇异性。最后,对于线性对称锥优化问题,首先刻画了对偶严格约束规范与二阶充分性条件的等价关系;然后证明了上述10条等价性质与原始对偶约束非退化条件的等价性。3.第4章具体推导了二阶锥、半正定实对称矩阵锥、半正定复Hermite矩阵锥以及半正定四元数Hermite矩阵锥二阶切集的表达式,并证明了这四种情况下二阶切集的支撑函数与对应的线性-二次函数是相等的,从而得到了当K同构于有限多个上述四种类型的锥的卡氏积时,第3章提出的两种形式的强二阶充分性条件等价,因此对于上述形式的K,第3章中关于锥优化问题扰动理论的等价性结论是成立的。

【Abstract】 This dissertation focuses on the study of variational analysis of symmetric cones and perturbation analysis of optimization over symmetric cones. The main results, obtained in this dissertation, may be summarized as follows:1. Chapter 2, based on the theory of Euclidean Jordan algebras, develops the elements in the variational analysis of symmetric cones related to the optimization problem. The formulas of tangent cones, second order tangent sets of symmetric cones and the B-subdifferential of the projection operator onto a symmetric cone are derived. A linear-quadratic function is introduced and the relationship with the supporting function of the second order tangent set is established.2. Chapter 3, based on the variational analysis developed in Chapter 2, studies the perturbation analysis of the nonlinear symmetric conic optimization problem. Firstly, the outer second order regularity of symmetric cones is proved and the no gap optimality conditions are obtained. Secondly, two types of strong second order sufficient optimality conditions for the optimization over symmetric cones are proposed, one of which is described through the linear-quadratic form and the other through the supporting function of the second order tangent set. For the nonconvex conic optimization problems whose two strong second order sufficient conditions coincide, we show that for a locally optimal solution, the following conditions are equivalent: the strong second order sufficient condition and primal constraint non-degeneracy, the strong regularity of the generalized equation corresponding to the KKT system, the nonsingularity of the Clarke’s generalized subdifferential of the nonsmooth mapping (KKT mapping for short) corresponding to the KKT conditions at the KKT point, strong stability of the optimal solution and other 4 conditions. Moreover, for a convex conic programming problem, the equivalence among all the listed conditions still holds when the cone is symmetric. Besides, each of these conditions is equivalent to the nonsingularity of B-subdifferential of the KKT mapping. Especially, for a linear conic programming problem, the relationship between the second order sufficient condition and the dual strict constraint qualification is characterized. Moreover, in this case the above 10 equivalent conditions for convex programming are proven to be equivalent to both the primal and dual constraint non-degeneracies.3. In Chapter 4, formulas for second order tangent sets of second order cone, the cone of positively semidefinite symmetric real matrices, the cone of positively semidefinite complex Hermitian matrices, and the cone of positively semidefinite quaternion Hermitian matrices, are developed and in each case the linear-quadratic form is proved to coincide with the supporting function of the second order tangent set. Therefore, when K is represented as a cone isomorphic to a Cartesian product of a finite number of these four types of cones, the two strong second order sufficient conditions are equivalent and all equivalent conditions about perturbation analysis in Chapter 3 are valid when K is of this kind of form.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络