4.6 Article

A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization

Journal

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 51, Issue 2, Pages 551-573

Publisher

SPRINGER
DOI: 10.1007/s10589-010-9363-1

Keywords

Trust region method; Nonsmooth convex minimization; Moreau-Yosida regularization; Proximal method; Cubic overestimation model

Funding

  1. Chinese NSF [10761001]
  2. Scientific Research Foundation of Guangxi University [X081082]

Ask authors/readers for more resources

By using the Moreau-Yosida regularization and proximal method, a new trust region algorithm is proposed for nonsmooth convex minimization. A cubic sub-problem with adaptive parameter is solved at each iteration. The global convergence and Q-superlinear convergence are established under some suitable conditions. The overall iteration bound of the proposed algorithm is discussed. Preliminary numerical experience is reported.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available