Bregman proximal relaxation of large-scale 0-1 problems

DOI10.1023/A:1008770914218zbMath0942.90026OpenAlexW1606733482MaRDI QIDQ1967121

Per Olov Lindberg, Krzysztof C. Kiwiel, Andreas Nõu

Publication date: 20 August 2000

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008770914218

zbMATH Keywords

Lagrangian relaxationconvex programmingdual ascentproximal methodsBregman functionsset covering problems

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical methods involving duality (49M29) Boolean programming (90C09)

Related Items (2)

A gradient-based approach for discrete optimum design ⋮ A survey on the continuous nonlinear resource allocation problem

This page was built for publication: Bregman proximal relaxation of large-scale 0-1 problems