applied mathematics
Bregman 近端点算法
Bregman proximal point algorithmAn iterative optimization algorithm used to solve maximal monotone inclusion problems by utilizing Bregman divergences to generate proximal point updates. / 一种利用 Bregman 散度生成近端点更新以求解极大单调包含问题的迭代优化算法。
- Knowledge type
- 工艺技术
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-10-23 20:00:50
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
maximal monotone operator: The set function defining the inclusion problemBregman divergence: The distance measure used for the proximal updatestep size: The parameter controlling the convergence rate
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsAccelerated Bregman proximal point algorithm for solving the maximal monotone inclusion problemOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Bregman proximal point algorithm.
Node update feedback
review required