A science fiction story in nonsmooth optimization originating at IIASA

zbMath1264.01016MaRDI QIDQ1946029

Yanyan Li

Publication date: 17 April 2013

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/DMJDMV/vol-ismp/44_mifflin-robert.html

zbMATH Keywords

nonsmooth optimizationhistorical surveysuperlinear convergencebundle methodsInternational Institute for Applied Systems Analysis (IIASA)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03) History of numerical analysis (65-03)

Related Items (7)

Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ A simple version of bundle method with linear programming ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ A fast gradient and function sampling method for finite-max functions ⋮ Essentials of numerical nonsmooth optimization ⋮ Essentials of numerical nonsmooth optimization

This page was built for publication: A science fiction story in nonsmooth optimization originating at IIASA