scientific article; zbMATH DE number 1070393

MaRDI QIDQ4356870zbMATH OpenFDO

Authors Krzysztof C. Kiwiel, A. Nõu, P. O. Lindberg

Publication date 20 November 1997

zbMATH Keywords

Bregman functionsconvex programminglarge-scale set covering problemsproximal point methods

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Boolean programming (90C09)

Recommendations

• Bregman proximal relaxation of large-scale 0-1 problems
• An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
• Proximal Minimization Methods with Generalized Bregman Functions
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

Cited in

(2)

• Bregman proximal relaxation of large-scale 0-1 problems
• A dual Bregman proximal gradient method for relatively-strongly convex optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4356870)