Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming

被引：10

作者：

Addou, A. ^{[2
]}

Roubi, A. ^{[1
]}

机构：

[1] Fac Sci & Tech, Dept Math & Informat, Settat, Morocco

[2] Fac Sci, Dept Math & Informat, Oujda, Morocco

来源：

OPTIMIZATION | 2010年 / 59卷 / 07期

关键词：

proximal methods; Bregman functions; B-functions; generalized fractional programming; Dinkelbach-type algorithms; VARIATIONAL-INEQUALITIES; REGULARIZATION METHODS; CONVEX MINIMIZATION; ALGORITHM; CONVERGENCE;

D O I：

10.1080/02331930903395857

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We analyse proximal-type minimization methods with generalized Bregman functions by considering a general scheme based on the one studied by Kiwiel [K.C. Kiwiel, Proximal minimization methods with generalized Bregman functions, SIAM J. Control Optim. 35(4) (1997), pp. 1142-1168.] and on successive approximation methods. We apply this scheme to construct methods for generalized fractional programmes.

引用

页码：1085 / 1105

页数：21

共 30 条

[1]

[Anonymous], 1996, Die Grundlehren der mathematischen Wissenschaften

[2]

AUSLENDER A, 1987, MATH PROGRAM STUD, V30, P102, DOI 10.1007/BFb0121157

[3] PENALTY-PROXIMAL METHODS IN CONVEX-PROGRAMMING [J].