The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Error bounds in mathematical programming
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
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
Self-citationMathematical Programs with Equilibrium Constraints
Luo, Z.-Q., Pang, J.-S., & Ralph, D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511983658 · Cited by 1,963
Self-citationHarker, P. T., & Pang, J.-S. (1990) · Mathematical Programming · doi:10.1007/bf01582255 · Cited by 1,817
Self-citationOn Projection Algorithms for Solving Convex Feasibility Problems
Bauschke, H. H., & Borwein, J. M. (1996) · SIAM Review · doi:10.1137/s0036144593251710 · Cited by 1,654
The extragradient method for finding saddle points and other problems
Korpelevich, G. M. (1976) · Medical Entomology and Zoology · Cited by 1,607
Graham, R., Grötschel, M., & Lovász, L. (1995) · Medical Entomology and Zoology · Cited by 1,526
Engineering and Economic Applications of Complementarity Problems
Ferris, M. C., & Pang, J. S. (1997) · SIAM Review · doi:10.1137/s0036144595285963 · Cited by 1,081
Self-citationStrongly Regular Generalized Equations
Robinson, S. M. (1980) · Mathematics of Operations Research · doi:10.1287/moor.5.1.43 · Cited by 968
A special newton-type optimization method
Fischer, A. (1992) · Optimization · doi:10.1080/02331939208843795 · Cited by 762
On the Convergence of the Proximal Point Algorithm for Convex Minimization
Güler, O. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329022 · Cited by 681
Semianalytic and subanalytic sets
Bierstone, E., & Milman, P. D. (1988) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699126 · Cited by 671
Non-Linear Programming Via Penalty Functions
Zangwill, W. I. (1967) · Management Science · doi:10.1287/mnsc.13.5.344 · Cited by 511
On the convergence of the coordinate descent method for convex differentiable minimization
Luo, Z. Q., & Tseng, P. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00939948 · Cited by 502
Smith, D. K., & Bertsekas, D. P. (1997) · The Journal of the Operational Research Society · doi:10.2307/3010437 · Cited by 474
Error bounds and convergence analysis of feasible descent methods: a general approach
Luo, Z.-Q., & Tseng, P. (1993) · Annals of Operations Research · doi:10.1007/bf02096261 · Cited by 420
Veinott, A. F., & Abadie, J. (1968) · Journal of the American Statistical Association · doi:10.2307/2283909 · Cited by 382
Projection methods for variational inequalities with application to the traffic assignment problem
Bertsekas, D. P., & Gafni, E. M. (1982) · Mathematical Programming Studies · doi:10.1007/bfb0120965 · Cited by 333
Asymptotic enumeration methods
Odlyzko, A. M. (1996) · The MIT Press eBooks · Cited by 303
Sur le problème de la division
Łojasiewicz, S. (1959) · Studia Mathematica · doi:10.4064/sm-18-1-87-136 · Cited by 300
Normal Maps Induced by Linear Transformations
Robinson, S. M. (1992) · Mathematics of Operations Research · doi:10.1287/moor.17.3.691 · Cited by 269
Exact Penalty Functions in Constrained Optimization
Pillo, G. D., & Grippo, L. (1989) · SIAM Journal on Control and Optimization · doi:10.1137/0327068 · Cited by 256
On the division of distributions by polynomials
Hörmander, L. (1958) · Arkiv för matematik · doi:10.1007/bf02589517 · Cited by 251
NE/SQP: A robust algorithm for the nonlinear complementarity problem
Pang, J., & Gabriel, S. A. (1993) · Mathematical Programming · doi:10.1007/bf01580617 · Cited by 211
Self-citationOptimisation : méthodes numériques
Auslender, A. (1976) · Masson eBooks · Cited by 210
Nonlinear complementarity as unconstrained and constrained minimization
Mangasarian, O. L., & Solodov, M. V. (1993) · Mathematical Programming · doi:10.1007/bf01585171 · Cited by 204
On linear convergence of iterative methods for the variational inequality problem
Tseng, P. (1995) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(94)00094-h · Cited by 195
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
Luo, Z.-Q., & Tseng, P. (1992) · SIAM Journal on Control and Optimization · doi:10.1137/0330025 · Cited by 190
Asymptotic Convergence Analysis of the Proximal Point Algorithm
Luque, F. J. (1984) · SIAM Journal on Control and Optimization · doi:10.1137/0322019 · Cited by 164
Advances in Optimization and Parallel Computing
Pardalos, P. M. (1992) · Elsevier eBooks · Cited by 146
Bassein, R. S. (1989) · American Mathematical Monthly · doi:10.1080/00029890.1989.11972271 · Cited by 139
Finite termination of the proximal point algorithm
Ferris, M. C. (1991) · Mathematical Programming · doi:10.1007/bf01594944 · Cited by 135
The gap function of a convex program
Hearn, D. W. (1982) · Operations Research Letters · doi:10.1016/0167-6377(82)90049-9 · Cited by 130
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
Luo, Z.-Q. T., Pang, J., Ralph, D., & Wu, S. (1996) · Mathematical Programming · doi:10.1007/bf02592205 · Cited by 113
Self-citationCombined Primal–Dual and Penalty Methods for Convex Programming
Kort, B., & Bertsekas, D. P. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314020 · Cited by 95
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
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
Luo, Z.-Q. T., & Tseng, P. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.4.846 · Cited by 74
Error Bounds for Piecewise Convex Quadratic Programs and Applications
Li, W. (1995) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012993243022 · Cited by 70
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
Tseng, P. (1991) · SIAM Journal on Optimization · doi:10.1137/0801036 · Cited by 69
Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
Boukari, D., & Fiacco, A. V. (1995) · Optimization · doi:10.1080/02331939508844053 · Cited by 69
Partial Proximal Minimization Algorithms for Convex Pprogramming
Bertsekas, D. P., & Tseng, P. (1994) · SIAM Journal on Optimization · doi:10.1137/0804031 · Cited by 41
Recent Trends in Optimization Theory and Applications
Agarwal, R. P. (1995) · WORLD SCIENTIFIC eBooks · doi:10.1142/2862 · Cited by 33
Penalty functions in subanalytic optimization
Dedieu, J. P. (1992) · Optimization · doi:10.1080/02331939208843840 · Cited by 23
Metadata
- Authors
- Pang, J.-S.
- Venue
- Mathematical Programming
- Published
- 1997-10
- Volume
- 79
- Issue
- 1-3
- Pages
- 299-332
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2082451773
- Cited by
- 441
- References
- 47
- FWCI
- 13.67
- 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.
