Relaxation methods for strictly convex regularizations of piecewise linear programs

DOI10.1007/S002459900090zbMath0918.65043OpenAlexW2080972376MaRDI QIDQ1273445

Krzysztof C. Kiwiel

Publication date: 17 August 1999

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002459900090

zbMATH Keywords

algorithmglobal convergencequadratic programmingconvex programmingnondifferentiable optimizationnetwork flowsrelaxation methodsdual coordinate ascententropy matrix maximizationgeneralized Bregman functionspiecewise linear programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)

This page was built for publication: Relaxation methods for strictly convex regularizations of piecewise linear programs