Extension of primal-dual interior point methods to diff-convex problems on symmetric cones

被引：3

作者：

Valkonen, Tuomo ^{[1
,2
]}

机构：

[1] Univ Jyvaskyla, Dept Math Informat Technol, SF-40351 Jyvaskyla, Finland

[2] Karl Franzens Univ Graz, Inst Math & Sci Comp, Graz, Austria

来源：

OPTIMIZATION | 2013年 / 62卷 / 03期

关键词：

symmetric cone; Jordan algebra; diff-convex; filter method; interior point; JORDAN ALGEBRAS; NONCONVEX OPTIMIZATION; ALGORITHMS; SUM;

D O I：

10.1080/02331934.2011.585465

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the extension of primal dual interior point methods for linear programming on symmetric cones, to a wider class of problems that includes approximate necessary optimality conditions for functions expressible as the difference of two convex functions of a special form. Our analysis applies the Jordan-algebraic approach to symmetric cones. As the basic method is local, we apply the idea of the filter method for a globalization strategy.

引用

页码：345 / 377

页数：33

共 50 条

[1] Extension of primal-dual interior point algorithms to symmetric cones
Schmieta, SH
Alizadeh, F
[J]. MATHEMATICAL PROGRAMMING, 2003, 96 (03) : 409 - 438
[2] Extension of primal-dual interior point algorithms to symmetric cones
S.H. Schmieta
F. Alizadeh
[J]. Mathematical Programming, 2003, 96 : 409 - 438
[3] Kernel Function-Based Primal-Dual Interior-Point Methods for Symmetric Cones Optimization
ZHAO Dequan
ZHANG Mingwang
[J]. Wuhan University Journal of Natural Sciences, 2014, 19 (06) : 461 - 468
[4] Generalization of primal-dual interior-point methods to convex optimization problems in conic form
Tunçel, L
[J]. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2001, 1 (03) : 229 - 254
[5] Primal-dual interior-point methods for self-scaled cones
Nesterov, YE
Todd, MJ
[J]. SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (02) : 324 - 364
[6] Primal-dual subgradient methods for convex problems
Nesterov, Yurii
[J]. MATHEMATICAL PROGRAMMING, 2009, 120 (01) : 221 - 259
[7] Primal-dual subgradient methods for convex problems
Yurii Nesterov
[J]. Mathematical Programming, 2009, 120 : 221 - 259
[8] Computational experience with a primal-dual interior point method for smooth convex placement problems
Kennings, A
Frazer, M
Vannelli, A
[J]. ISCAS '98 - PROCEEDINGS OF THE 1998 INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-6, 1998, : E191 - E194
[9] Primal-dual affine scaling interior point methods for linear complementarity problems
Potra, Florian A.
[J]. SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (01) : 114 - 143
[10] Primal-dual Feasible Interior Point Algorithm for Convex Quadratic Programming
Yong, Longquan
[J]. PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON MODELLING AND SIMULATION (ICMS2009), VOL 3, 2009, : 109 - 113

← 1 2 3 4 5 →