The DOI matches its Crossref record.
Proximal Minimization Methods with Generalized Bregman Functions
Abstract
We consider methods for minimizing a convex function f that generate a sequence {xk} by taking xk+1 to be an approximate minimizer of f(x)+Dh(x,xk)/ck, where ck > 0 and Dh is the D-function of a Bregman function h. Extensions are made to B-functions that generalize Bregman functions and cover more applications. Convergence is established under criteria amenable to implementation. Applications are made to nonquadratic multiplier methods for nonlinear programs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
An Iterative Regularization Method for Total Variation-Based Image Restoration
Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040605412 · Cited by 1,787
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
Interior Gradient and Proximal Methods for Convex and Conic Optimization
Auslender, A., & Teboulle, M. (2006) · SIAM Journal on Optimization · doi:10.1137/s1052623403427823 · Cited by 269
Ghadimi, S., & Lan, G. (2012) · SIAM Journal on Optimization · doi:10.1137/110848864 · Cited by 269
Metadata
- Authors
- Kiwiel, K. C.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 1997-07
- Volume
- 35
- Issue
- 4
- Pages
- 1142-1168
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2067272684
- Cited by
- 236
- References
- 0
- FWCI
- 14.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Proximal Minimization Methods with Generalized Bregman Functions. https://app.cochat.ai/papers/10.1137/s0363012995281742
- The paper
- Kiwiel, K. C. (1997). Proximal Minimization Methods with Generalized Bregman Functions. SIAM Journal on Control and Optimization. https://doi.org/10.1137/s0363012995281742
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.