Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones

被引:104
作者
Yoshise, Akiko [1 ]
机构
[1] Univ Tsukuba, Grad Sch Syst & Informat Engn, Tsukuba, Ibaraki 3058573, Japan
关键词
complementarity problem; symmetric cone; homogeneous algorithm; existence of trajectory; interior point method; detecting infeasibility;
D O I
10.1137/04061427X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We study the continuous trajectories for solving monotone nonlinear mixed complementarity problems over symmetric cones. While the analysis in [ L. Faybusovich, Positivity, 1 ( 1997), pp. 331 - 357] depends on the optimization theory of convex log-barrier functions, our approach is based on the paper of Monteiro and Pang [ Math. Oper. Res., 23 ( 1998), pp. 39 - 60], where a vast set of conclusions concerning continuous trajectories is shown for monotone complementarity problems over the cone of symmetric positive semidefinite matrices. As an application of the results, we propose a homogeneous model for standard monotone nonlinear complementarity problems over symmetric cones and discuss its theoretical aspects. Consequently, we show the existence of a path having the following properties: ( a) The path is bounded and has a trivial starting point without any regularity assumption concerning the existence of feasible or strictly feasible solutions. (b) Any accumulation point of the path is a solution of the homogeneous model. ( c) If the original problem is solvable, then every accumulation point of the path gives us a finite solution. (d) If the original problem is strongly infeasible, then, under the assumption of Lipschitz continuity, any accumulation point of the path gives us a finite certificate proving infeasibility.
引用
收藏
页码:1129 / 1153
页数:25
相关论文
共 33 条
[1]  
ALIZADEH F, 2000, HDB SEMIDEFINITE PRO, P195
[2]   On a homogeneous algorithm for the monotone complementarity problem [J].
Andersen, ED ;
Ye, YY .
MATHEMATICAL PROGRAMMING, 1999, 84 (02) :375-399
[3]  
CHUA CB, 2004, NEW NOTION WEIGHTED
[4]   Initialization in semidefinite programming via a self-dual skew-symmetric embedding [J].
deKlerk, E ;
Roos, C ;
Terlaky, T .
OPERATIONS RESEARCH LETTERS, 1997, 20 (05) :213-221
[5]  
Faraut J., 1994, Analysis on symmetric cones
[6]   Linear systems in Jordan algebras and primal-dual interior-point algorithms [J].
Faybusovich, L .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1997, 86 (01) :149-175
[7]   Euclidean Jordan algebras and interior-point algorithms [J].
Faybusovich, L .
POSITIVITY, 1997, 1 (04) :331-357
[8]   Some P-properties for linear transformations on Euclidean Jordan algebras [J].
Gowda, MS ;
Sznajder, R ;
Tao, J .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 393 :203-232
[10]   Barrier functions in interior point methods [J].
Guler, O .
MATHEMATICS OF OPERATIONS RESEARCH, 1996, 21 (04) :860-885