The DOI matches its Crossref record.
Iterative Solution of Nonlinear Equations in Several Variables
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221
Mean shift, mode seeking, and clustering
Cheng, Y. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400568 · Cited by 3,856
Generalized additive models for location, scale and shape.
Rigby, R. A., & Stasinopoulos, D. M. (2005) · Journal of the Royal Statistical Society Series C: Applied Statistics · doi:10.1111/j.1467-9876.2005.00510.x · Cited by 3,228
Mixture Densities, Maximum Likelihood and the EM Algorithm
Redner, R. A., & Walker, H. F. (1984) · SIAM Review · doi:10.1137/1026034 · Cited by 2,693
Dubovik, O., & King, M. D. (2000) · Journal of Geophysical Research: Atmospheres · doi:10.1029/2000jd900282 · Cited by 2,484
Jacobian-free Newton–Krylov methods: a survey of approaches and applications
Knoll, D. A., & Keyes, D. E. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2003.08.010 · Cited by 1,930
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
Harker, P. T., & Pang, J.-S. (1990) · Mathematical Programming · doi:10.1007/bf01582255 · Cited by 1,817
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Bolte, J., Sabach, S., & Teboulle, M. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0701-9 · Cited by 1,688
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
A nonsmooth version of Newton's method
Qi, L., & Sun, J. (1993) · Mathematical Programming · doi:10.1007/bf01581275 · Cited by 1,464
Wright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Gradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
A Nonmonotone Line Search Technique for Newton’s Method
Grippo, L., Lampariello, F., & Lucidi, S. (1986) · SIAM Journal on Numerical Analysis · doi:10.1137/0723046 · Cited by 1,156
Coleman, T. F., & Li, Y. (1994) · Mathematical Programming · doi:10.1007/bf01582221 · Cited by 1,135
Space-alternating generalized expectation-maximization algorithm
Fessler, J. A., & Hero, A. O. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.324732 · Cited by 1,063
Stochastic choice of basis functions in adaptive function approximation and the functional-link net
Igelnik, B., & Pao, Y.-H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.471375 · Cited by 955
Conn, A. R., Gould, N. I. M., & Toint, P. (1991) · SIAM Journal on Numerical Analysis · doi:10.1137/0728030 · Cited by 873
Primal-dual subgradient methods for convex problems
Nesterov, Y. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0149-x · Cited by 835
Representations of quasi-Newton matrices and their use in limited memory methods
Byrd, R. H., Nocedal, J., & Schnabel, R. B. (1994) · Mathematical Programming · doi:10.1007/bf01582063 · Cited by 744
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
On the linear convergence of the alternating direction method of multipliers
Hong, M., & Luo, Z.-Q. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1034-2 · Cited by 690
On the Computation of All Global Minimizers Through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826076 · Cited by 681
Newton’s Method with a Model Trust Region Modification
Sorensen, D. C. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719026 · Cited by 560
THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS
Powell, M. J. D. (1978) · Nonlinear Programming 3 · doi:10.1016/b978-0-12-468660-1.50007-4 · Cited by 541
Multigrid methods: Fundamental algorithms, model problem analysis and applications
Stüben, K., & Trottenberg, U. (1982) · Lecture Notes in Mathematics · doi:10.1007/bfb0069928 · Cited by 539
Monte Carlo Methods in Statistical Mechanics: Foundations and New Algorithms
Sokal, A. (1997) · NATO ASI Series · doi:10.1007/978-1-4899-0319-8_6 · Cited by 536
Algorithms for nonlinear constraints that use lagrangian functions
Powell, M. J. D. (1978) · Mathematical Programming · doi:10.1007/bf01588967 · Cited by 514
A fast algorithm for matrix balancing
Knight, P. A., & Ruiz, D. (2013) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drs019 · Cited by 507
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
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Han, S.-P. (1976) · Mathematical Programming · doi:10.1007/bf01580395 · Cited by 477
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Deuflhard, P. (1974) · Numerische Mathematik · doi:10.1007/bf01406969 · Cited by 467
Error bounds in mathematical programming
Pang, J.-S. (1997) · Mathematical Programming · doi:10.1007/bf02614322 · Cited by 441
Differential variational inequalities
Pang, J.-S., & Stewart, D. E. (2008) · Mathematical Programming · doi:10.1007/s10107-006-0052-x · Cited by 439
Successive overrelaxation for support vector machines
Mangasarian, O. L., & Musicant, D. R. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788643 · Cited by 438
Hayes, M. (1982) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1982.1163863 · Cited by 431
Constrained iterative restoration algorithms
Schafer, R. W., Mersereau, R. M., & Richards, M. A. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.11987 · Cited by 424
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
Truncated-Newton algorithms for large-scale unconstrained optimization
Dembo, R. S., & Steihaug, T. (1983) · Mathematical Programming · doi:10.1007/bf02592055 · Cited by 420
On Jumps in Common Stock Prices and Their Impact on Call Option Pricing
BALL, C. A., & TOROUS, W. N. (1985) · The Journal of Finance · doi:10.1111/j.1540-6261.1985.tb04942.x · Cited by 409
Convergence of EM image reconstruction algorithms with Gibbs smoothing
Lange, K. (1990) · IEEE Transactions on Medical Imaging · doi:10.1109/42.61759 · Cited by 400
ICI mitigation for pilot-aided OFDM mobile systems
Mostofi, Y., & Cox, D. C. (2005) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2004.840235 · Cited by 398
Latent variable graphical model selection via convex optimization
Chandrasekaran, V., Parrilo, P. A., & Willsky, A. S. (2012) · The Annals of Statistics · doi:10.1214/11-aos949 · Cited by 377
Brown, K. M., & Dennis, J. E. (1971) · Numerische Mathematik · doi:10.1007/bf01404679 · Cited by 370
A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression
Boggs, P. T., Byrd, R. H., & Schnabel, R. B. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908085 · Cited by 369
Some Notes on Alternating Optimization
Bezdek, J. C., & Hathaway, R. J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45631-7_39 · Cited by 355
Quantile Regression via an MM Algorithm
Hunter, D. R., & Lange, K. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474866 · Cited by 353
A complete generalized solution to the inverse kinematics of robots
Goldenberg, A., Benhabib, B., & Fenton, R. (1985) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1985.1086995 · Cited by 349
Wright, M. (2004) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-04-01040-7 · Cited by 345
A new method of solving the liquid structure integral equations
Gillan, M. J. (1979) · Molecular Physics · doi:10.1080/00268977900102861 · Cited by 344
Generalized Linear Models with Varying Dispersion
Smyth, G. K. (1989) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1989.tb01747.x · Cited by 342
A Survey of Parallel Algorithms in Numerical Linear Algebra
Heller, D. (1978) · SIAM Review · doi:10.1137/1020096 · Cited by 337
Newton-type methods for unconstrained and linearly constrained optimization
Gill, P. E., & Murray, W. (1974) · Mathematical Programming · doi:10.1007/bf01585529 · Cited by 335
Theory of algorithms for unconstrained optimization
Nocedal, J. (1992) · Acta Numerica · doi:10.1017/s0962492900002270 · Cited by 333
A Theoretical Study of Some Maximum Likelihood Algorithms for Emission and Transmission Tomography
Lange, K., Bahn, M., & Little, R. (1987) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.1987.4307810 · Cited by 330
LOCAL ACTIVITY IS THE ORIGIN OF COMPLEXITY
CHUA, L. O. (2005) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127405014337 · Cited by 325
Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
Zhang, Y. (1998) · Optimization Methods and Software · doi:10.1080/10556789808805699 · Cited by 320
Björck, Å. (1990) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(05)80036-5 · Cited by 313
Globally convergent algorithms for maximum a posteriori transmission tomography
Lange, K., & Fessler, J. A. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.465107 · Cited by 313
Exponential observers for nonlinear dynamic systems
Kou, S. R., Elliott, D. L., & Tarn, T. J. (1975) · Information and Control · doi:10.1016/s0019-9958(75)90382-4 · Cited by 299
Jacobson, A. G., & Gordon, R. (1976) · Journal of Experimental Zoology · doi:10.1002/jez.1401970205 · Cited by 289
Algorithms for Separable Nonlinear Least Squares Problems
Ruhe, A., & Wedin, P. Å. (1980) · SIAM Review · doi:10.1137/1022057 · Cited by 284
Abriola, L. M., & Pinder, G. F. (1985) · Water Resources Research · doi:10.1029/wr021i001p00019 · Cited by 283
Observers for nonlinear stochastic systems
Tarn, T.-J., & Rasis, Y. (1976) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1976.1101300 · Cited by 283
Schittkowski, K. (1982) · Numerische Mathematik · doi:10.1007/bf01395810 · Cited by 273
Optimal motion and structure estimation
Weng, J., Ahuja, N., & Huang, T. S. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232074 · Cited by 270
Competitive Design of Multiuser MIMO Systems Based on Game Theory: A Unified View
Scutari, G., Palomar, D., & Barbarossa, S. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080907 · Cited by 265
Sliding window filter with application to planetary landing
Sibley, G., Matthies, L., & Sukhatme, G. (2010) · Journal of Field Robotics · doi:10.1002/rob.20360 · Cited by 259
Robinson, S. M. (1974) · Mathematical Programming · doi:10.1007/bf01585500 · Cited by 254
Privacy-Preserving Patient Similarity Learning in a Federated Environment: Development and Analysis
Lee, J., Sun, J., Wang, F., Wang, S., Jun, C.-H., & Jiang, X. (2018) · JMIR Medical Informatics · doi:10.2196/medinform.7744 · Cited by 196
Ill-Conditioning in Neural Network Training Problems
Saarinen, S., Bramley, R., & Cybenko, G. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914044 · Cited by 141
Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
Jakovetic, D., Moura, J. M. F., & Xavier, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2363299 · Cited by 123
Grounded by Gravity: A Well-Behaved Trade Model with Industry-Level Economies of Scale
Kucheryavyy, K., Lyn, G., & Rodríguez-Clare, A. (2016) · doi:10.3386/w22484 · Cited by 36
Accelerating Transformer Inference for Translation via Parallel Decoding
Santilli, A., Severino, S., Postolache, E., Maiorca, V., Mancusi, M., Marin, R., & Rodola, E. (2023) · Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2023.acl-long.689 · Cited by 29
Metadata
- Authors
- I., E., Ortega, J. M., & Rheinboldt, W. C.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1971-04
- Volume
- 25
- Issue
- 114
- Pages
- 398
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W4299512035
- Cited by
- 4,408
- References
- 0
- FWCI
- 58.06
- 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.