scientific article; zbMATH DE number 686908

zbMATH Open0811.90084MaRDI QIDQ4312992FDOQ4312992

Authors: U. Brännlund 

Publication date: 1 May 1995

Title of this publication is not available (Why is that?)

Recommendations

• A bundle Bregman proximal method for convex nondifferentiable minimization
• scientific article; zbMATH DE number 3924518
• scientific article; zbMATH DE number 764394
• Publication:4733677
• Constructing mixed algorithms on the basis of some bundle method

zbMATH Keywords

bundle methodconvex nondifferentiable functionnondifferentiable test problems

Mathematics Subject Classification ID

Convex programming (90C25)

Cited In (7)

• On a feasible descent algorithm for solving min-max problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A descent proximal level bundle method for convex nondifferentiable optimization
• Constructing mixed algorithms on the basis of some bundle method
• Relaxed steepest descent and Cauchy-Barzilai-Borwein method
• An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization

Uses Software

• LSSOL

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 Q4312992)