Subgradient Method for Nonconvex Nonsmooth Optimization

被引:29
作者
Bagirov, A. M. [1 ]
Jin, L. [1 ]
Karmitsa, N. [2 ]
Al Nuaimat, A. [1 ]
Sultanova, N. [1 ]
机构
[1] Univ Ballarat, Sch Sci Informat Technol & Engn, Ballarat, Vic 3353, Australia
[2] Univ Turku, Dept Math, Turku 20014, Finland
关键词
Nonsmooth optimization; Nonconvex optimization; Subgradient method; Bundle method; MEMORY BUNDLE METHOD; MINIMIZATION;
D O I
10.1007/s10957-012-0167-6
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we introduce a new method for solving nonconvex nonsmooth optimization problems. It uses quasisecants, which are subgradients computed in some neighborhood of a point. The proposed method contains simple procedures for finding descent directions and for solving line search subproblems. The convergence of the method is studied and preliminary results of numerical experiments are presented. The comparison of the proposed method with the subgradient and the proximal bundle methods is demonstrated using results of numerical experiments.
引用
收藏
页码:416 / 435
页数:20
相关论文
共 26 条
[11]   A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization [J].
Fuduli, A ;
Gaudioso, M ;
Giallombardo, G .
OPTIMIZATION METHODS & SOFTWARE, 2004, 19 (01) :89-102
[12]   Minimizing nonconvex nonsmooth functions via cutting planes and proximity control [J].
Fuduli, A ;
Gaudioso, M ;
Giallombardo, G .
SIAM JOURNAL ON OPTIMIZATION, 2004, 14 (03) :743-756
[13]   New limited memory bundle method for large-scale nonsmooth optimization [J].
Haarala, M ;
Miettinen, K ;
Mäkelä, MM .
OPTIMIZATION METHODS & SOFTWARE, 2004, 19 (06) :673-692
[14]   Globally convergent limited memory bundle method for large-scale nonsmooth optimization [J].
Haarala, Napsu ;
Miettinen, Kaisa ;
Makela, Marko M. .
MATHEMATICAL PROGRAMMING, 2007, 109 (01) :181-205
[15]   A REDISTRIBUTED PROXIMAL BUNDLE METHOD FOR NONCONVEX OPTIMIZATION [J].
Hare, Warren ;
Sagastizabal, Claudia .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (05) :2442-2473
[16]  
Kiwiel K., 1985, METHODS DESCENT NOND
[17]   A bundle-Newton method for nonsmooth unconstrained minimization [J].
Luksan, L ;
Vlcek, J .
MATHEMATICAL PROGRAMMING, 1998, 83 (03) :373-391
[18]   Algorithm 811: NDA: Algorithms for nondifferentiable optimization [J].
Luksan, L ;
Vlcek, J .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2001, 27 (02) :193-213
[19]  
Luksan L., 2000, 798 ACAD SCI CZECH R
[20]  
Makela M. M., 1992, Nonsmooth optimization: Analysis and Algorithms with Applications to Optimal Control