The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Smoothing methods for convex inequalities and linear complementarity problems
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
Cites
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
The Linear Complementarity Problem
Cottle, R. W., Pang, J.-S., & Stone, R. E. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719000 · Cited by 2,788
The path solver: a nommonotone stabilization scheme for mixed complementarity problems
Dirkse, S. P., & Ferris, M. C. (1995) · Optimization Methods and Software · doi:10.1080/10556789508805606 · Cited by 734
A polynomial-time algorithm for a class of linear complementarity problems
Kojima, M., Mizuno, S., & Yoshise, A. (1989) · Mathematical Programming · doi:10.1007/bf01587074 · Cited by 345
Newton-Type Minimization via the Lanczos Method
Nash, S. G. (1984) · SIAM Journal on Numerical Analysis · doi:10.1137/0721052 · Cited by 338
Theory of algorithms for unconstrained optimization
Nocedal, J. (1992) · Acta Numerica · doi:10.1017/s0962492900002270 · Cited by 333
On Smoothing Exact Penalty Functions for Convex Constrained Optimization
Pınar, M. Ç., & Zenios, S. A. (1994) · SIAM Journal on Optimization · doi:10.1137/0804027 · Cited by 150
Mathematical Programming in Neural Networks
Mangasarian, O. L. (1993) · INFORMS journal on computing · doi:10.1287/ijoc.5.4.349 · Cited by 105
Self-citationA Finite Smoothing Algorithm for Linear $l_1 $ Estimation
Madsen, K., & Nielsen, H. B. (1993) · SIAM Journal on Optimization · doi:10.1137/0803010 · Cited by 88
A Condition Number for Differentiable Convex Inequalities
Mangasarian, O. L. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.2.175 · Cited by 79
Self-citation
Cited by
Engineering and Economic Applications of Complementarity Problems
Ferris, M. C., & Pang, J. S. (1997) · SIAM Review · doi:10.1137/s0036144595285963 · Cited by 1,081
RSVM: Reduced Support Vector Machines
Lee, Y.-J., & Mangasarian, O. L. (2001) · Proceedings of the 2001 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972719.13 · Cited by 647
Self-citationSmoothing methods for nonsmooth, nonconvex minimization
Chen, X. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0569-0 · Cited by 295
Metadata
- Authors
- Chen, C., & Mangasarian, O. L.
- Venue
- Mathematical Programming
- Published
- 1995-11
- Volume
- 71
- Issue
- 1
- Pages
- 51-69
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2036368324
- Cited by
- 277
- References
- 11
- FWCI
- 5.92
- 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
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.
