.png){kind=icon}
Return
A filter-variable-metric method for nonsmooth convex constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2008.11.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose an algorithm for solving nonsmooth convex constrained problems, which combines the ideas of the variable metric methods with the filter strategy for evaluating candidate points. The resulted algorithm inherits some attractive features from both approaches. On the one hand, the time-consuming quadratic programming sub-problems do not need to be solved. On the other hand, the dominance concept of multiobjective optimization was used and the new iterate must satisfy so-called filter criterion. Some encouraging preliminary computational results are reported. Crown Copyright (C) 2008 Published by Elsevier Inc. All rights reserved.
Keywords:
Constrained optimization
Nonsmooth optimization
Convex optimization
Variable metric method
Filter method
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
ShareSaveDecreased magnitude of heart rate spectral components in coronary artery disease. Its relation to angiographic severity..png)
Circulation
OAAI
CirculationIF0
OAAIShareSaveShareSaveShareSave
View more