.png){kind=icon}
Return
A multi-step doubly stabilized bundle method for nonsmooth convex optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2020.125154.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, by incorporating a multi-step scheme into the doubly stabilized bundle method (DSBM) recently developed by Oliveira and Solodov (2016), we propose a multistep doubly stabilized bundle method (MDSBM) for solving nonsmooth convex optimization problems. In contrast to a single sequence generated by DSBM, the MDSBM generates three related iteration sequences. One is used to build the cutting-planes model of the objective function, another is served as the stability centers, and the third is the sequence of solutions to our new doubly stabilized subproblems. In addition, we present a new descent test criterion, aiming to take advantage of the multi-step scheme. We establish global convergence of the proposed method, and finally present some promising numerical results. (C) 2020 Elsevier Inc. All rights reserved.
Keywords:
Nonsmooth optimization
Doubly stabilized bundle method
Multi-step scheme
Descent test criterion
Global convergence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
View more