.png){kind=icon}
Return
A variable metric method for nonsmooth convex constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.05.132.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 is close in spirit and structure to the well-developed unconstrained variable metric method. In the algorithm, time-consuming quadratic programming sub-problems do not need to be solved. Furthermore, neither penalty function nor filter is employed. Global convergence of the method is established. Some encouraging preliminary computational results are reported. (c) 2006 Elsevier Inc. All rights reserved.
Keywords:
constrained optimization
nonsmooth convex optimization
variable metric method
global convergence
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
ShareSaveDecreased magnitude of heart rate spectral components in coronary artery disease. Its relation to angiographic severity..png)
Circulation
OAAI
CirculationIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more