Bregman method
Bregman's method is an iterative algorithm to solve certain convex optimization problems. The algorithm is a row-action method accessing constraint functions one by one and the method is particularly suited for large optimization problems where constraints can be efficiently enumerated. The method has links to the method of multipliers and dual ascent method and multiple generalizations exist.
Wikipage disambiguates
primaryTopic
Bregman method
Bregman's method is an iterative algorithm to solve certain convex optimization problems. The algorithm is a row-action method accessing constraint functions one by one and the method is particularly suited for large optimization problems where constraints can be efficiently enumerated. The method has links to the method of multipliers and dual ascent method and multiple generalizations exist.
has abstract
Bregman's method is an iterati ...... l methods have been developed.
@en
Link from a Wikipage to an external page
Wikipage page ID
21,410,975
Wikipage revision ID
727,809,607
subject
hypernym
type
comment
Bregman's method is an iterati ...... ultiple generalizations exist.
@en
label
Bregman method
@en