First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints

被引:47
作者
Ding, Chao [1 ]
Sun, Defeng [2 ,3 ]
Ye, Jane J. [4 ]
机构
[1] Chinese Acad Sci, Natl Ctr Math & Interdisciplinary Sci, Beijing, Peoples R China
[2] Natl Univ Singapore, Dept Math, Singapore 119076, Singapore
[3] Natl Univ Singapore, Risk Management Inst, Singapore 119076, Singapore
[4] Univ Victoria, Dept Math & Stat, Victoria, BC V8W 3R4, Canada
基金
加拿大自然科学与工程研究理事会; 美国国家科学基金会;
关键词
Mathematical program with semidefinite cone complementarity constraints; Necessary optimality conditions; Constraint qualifications; S-stationary conditions; M-stationary conditions; C-stationary conditions; OPTIMIZATION PROBLEMS; GLOBAL OPTIMIZATION; LARGEST EIGENVALUES; NONCONVEX NLPS; SYSTEMS; SEMISMOOTHNESS; APPROXIMATION; MINIMIZATION; NONSMOOTH; CALMNESS;
D O I
10.1007/s10107-013-0735-z
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we consider a mathematical program with semidefinite cone complementarity constraints (SDCMPCC). Such a problem is a matrix analogue of the mathematical program with (vector) complementarity constraints (MPCC) and includes MPCC as a special case. We first derive explicit formulas for the proximal and limiting normal cone of the graph of the normal cone to the positive semidefinite cone. Using these formulas and classical nonsmooth first order necessary optimality conditions we derive explicit expressions for the strong-, Mordukhovich- and Clarke- (S-, M- and C-)stationary conditions. Moreover we give constraint qualifications under which a local solution of SDCMPCC is a S-, M- and C-stationary point. Moreover we show that applying these results to MPCC produces new and weaker necessary optimality conditions.
引用
收藏
页码:539 / 579
页数:41
相关论文
共 65 条
[1]  
[Anonymous], 2002, THESIS STANFORD U
[2]  
[Anonymous], 1996, MATH PROGRAMS EQUILI, DOI DOI 10.1017/CBO9780511983658
[3]  
[Anonymous], 1998, Variational Analysis
[4]  
[Anonymous], 1971, Mathematical Programming
[5]   LIPSCHITZ BEHAVIOR OF SOLUTIONS TO CONVEX MINIMIZATION PROBLEMS [J].
AUBIN, JP .
MATHEMATICS OF OPERATIONS RESEARCH, 1984, 9 (01) :87-111
[6]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[7]   Robust optimization - methodology and applications [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2002, 92 (03) :453-480
[8]  
Bhatia R., 2013, MATRIX ANAL
[9]   Approximation of rank function and its application to the nearest low-rank correlation matrix [J].
Bi, Shujun ;
Han, Le ;
Pan, Shaohua .
JOURNAL OF GLOBAL OPTIMIZATION, 2013, 57 (04) :1113-1137
[10]  
Bonnans J.F., 2013, PERTURBATION ANAL OP