返回
Essentials of numerical nonsmooth optimization
DOI:10.1007/s10479-021-04498-y.png)
摘要
En 中文
Approximately 60 years ago two seminal findings, the cutting plane and the subgradient methods, radically changed the landscape of mathematical programming. They provided, for the first time, the practical chance to optimize real functions of several variables characterized by kinks, namely by discontinuities in their derivatives. Convex functions, for which a superb body of theoretical research was growing in parallel, naturally became the main application field of choice. The aim of the paper is to give a concise survey of the key ideas underlying successive development of the area, which took the name of numerical nonsmooth optimization. The focus will be, in particular, on the research mainstreams generated under the impulse of the two initial discoveries.
Keyword:
Nonsmooth optimization
Cutting plane
Subgradient method
Bundle method
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
Water Use Patterns of Sympatric Przewalski’s Horse and Khulan: Interspecific Comparison Reveals Niche Differences
PLOS ONE
IF0
Classification in the multiple instance learning framework via spherical separation
SOFT COMPUTING
IF2.5
Economic Importance and Growth Rate of Broiler Chickens Fed with Water Leaf (Talinum triangulare) Meal Supplements肉鸡饲喂水叶(Talinum triangulare)餐补充剂的经济重要性与生长速率

