The DOI matches its Crossref record.
A generalized proximal point algorithm for certain non-convex minimization problems
Abstract
An algorithm is presented for minimizing a function which is the sum of a continuously differentiable function and a convex function. The class of such problems contains as a special case that of minimizing a continuously differentiable function over a closed convex set. This algorithm may be viewed as a generalization of the proximal point algorithm to cope with non-convexity of the objective function by linearizing the differentiable term at each iteration. Convergence of the algorithm is proved and the rate of convergence is analysed.
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
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Gradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
A coordinate gradient descent method for nonsmooth separable minimization
Tseng, P., & Yun, S. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0170-0 · Cited by 728
Templates for convex cone problems with applications to sparse signal recovery
Becker, S. R., Candès, E. J., & Grant, M. C. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0029-5 · Cited by 608
Metadata
- Authors
- FUKUSHIMA, M., & MINE, H.
- Venue
- International Journal of Systems Science
- Publisher
- Informa UK Limited
- Published
- 1981-01
- Volume
- 12
- Issue
- 8
- Pages
- 989-1000
- ISSN
- 0020-7721 (ISSN-L)
- 1464-5319
- OpenAlex
- W2048742402
- Cited by
- 166
- References
- 0
- FWCI
- 0.57
- 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: A generalized proximal point algorithm for certain non-convex minimization problems. https://app.cochat.ai/papers/10.1080/00207728108963798
- The paper
- FUKUSHIMA, M., & MINE, H. (1981). A generalized proximal point algorithm for certain non-convex minimization problems. International Journal of Systems Science. https://doi.org/10.1080/00207728108963798
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.