A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs

DOI10.1137/110854400zbMath1301.65042OpenAlexW2120467101MaRDI QIDQ3192093

Jieqiu Chen, Samuel Burer

Publication date: 26 September 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110854400

zbMATH Keywords

nonsmooth optimizationnumerical examplessubgradient methodNewton methodmachine learninglarge-scale linear programmingexcessive-gap technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)

Related Items (2)

OSGA: a fast subgradient algorithm with optimal complexity ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization

This page was built for publication: A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs