An Approximate Quasi-Newton Bundle-Type Method for Nonsmooth Optimization
Copyright policy )An Approximate Quasi-Newton Bundle-Type Method for Nonsmooth Optimization
An implementable algorithm for solving a nonsmooth convex optimization problem is proposed by combining Moreau-Yosida regularization and bundle and quasi-Newton ideas. In contrast with quasi-Newton bundle methods of Mifflin et al. (1998), we only assume that the values of the objective function and its subgradients are evaluated approximately, which makes the method easier to implement. Under some reasonable assumptions, the proposed method is shown to have a Q-superlinear rate of convergence.
- Liaoning Normal University China (People's Republic of)
- Dalian Polytechnic University China (People's Republic of)
Convex programming, quasi-Newton bundle method, Moreau-Yosida regularization, QA1-939, nonsmooth convex optimization problem, Mathematics
Convex programming, quasi-Newton bundle method, Moreau-Yosida regularization, QA1-939, nonsmooth convex optimization problem, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!