A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.     

有效点、弱有效点和真有效点的锥刻画

利用集合在某点的相依切锥、法向锥和可行方向锥等研究向量优化问题的有效点、 弱有效点和真有效点的特征,对局部有效点、局部弱有效点和局部真有效点与集合的各 锥之间的关系作了刻画.     

集值优化问题强有效解的Kuhn Tucker最优性条件

在局部凸空间中考虑集值优化问题（VP）在强有效解意义下的Kuhn-Tucker最优性条件．在近似锥．次类凸假设下利用择一性定理得到了（VP）取得强有效解的必要条件，利用基泛函的性质给出了（VP）取得强有效解的充分条件，最后给出了一种与（VP）等价的无约束规划。     

非自治时滞微分方程的正周期解

By utilizing a fixed point theorem on cone,some new results on the existence of positive periodic solutions for nonautonomous differential equations with delay are derived.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

四阶微分方程奇异边值问题的正解

本文利用锥上的不动点指数理论,在更一般的边界条件下讨论了一类四阶奇异边值问题正解的存在性并给出了应用．     

计算全息图产生的锥面波在激光准直中的应用

本文提出了用计算全息图产生锥面波的方法.将全息图置于激光光路中,它的衍射图样中心在空间形成了一条准直线.文中对锥面波的传播、准直精度及准直距离作了理论分析,给出了实验结果.     

About Regularity of Collections of Sets

The paper continues investigations of stationarity and regularity properties of collections of sets in normed spaces. It contains a summary of different characterizations (both primal and dual) of regularity and a list of sufficient conditions for a collection of sets to be regular.     

倒置结构锥形束计算机层析的精确成像与Grangeat算法实现

研究了一种新的圆加垂直单弧段的锥顶轨迹的锥形束计算机层析（CT）的完全性条件和精确重建的Grangeat方法，提出了倒置结构锥形束计算机层析的便于实现的圆加垂直多弧段的成像结构及进行精确重建的完全性条件。利用倒置成像结构与现有成像结构之间的等价关系，给出了倒置结构锥形束计算机层析的重建算法。最后，对上述几方面进行了计算机模拟。     

A result on sets,with applications to vector optimization

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.