The DOI matches its Crossref record.
Numerical methods for least squares problems
Abstract
Preface 1. Mathematical and statistical properties of least squares solutions 2. Basic numerical methods 3. Modified least squares problems 4. Generalized least squares problems 5. Constrained least squares problems 6. Direct methods for sparse problems 7. Iterative methods for least squares problems 8. Least squares problems with special bases 9. Nonlinear least squares problems Bibliography Index.
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 Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Bundle Adjustment — A Modern Synthesis
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
Numerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
Beck, A., & Teboulle, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2028250 · Cited by 2,004
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Bourhis, L. J., Dolomanov, O. V., Gildea, R. J., Howard, J. A. K., & Puschmann, H. (2015) · Acta Crystallographica Section A Foundations and Advances · doi:10.1107/s2053273314022207 · Cited by 1,911
On the mathematical foundations of learning
Cucker, F., & Smale, S. (2001) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-01-00923-5 · Cited by 1,545
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
Tikhonov Regularization and Total Least Squares
Golub, G. H., Hansen, P. C., & O'Leary, D. P. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897326432 · Cited by 1,029
Fitting hyperelastic models to experimental data
Ogden, R. W., Saccomandi, G., & Sgura, I. (2004) · Computational Mechanics · doi:10.1007/s00466-004-0593-y · Cited by 775
Separable nonlinear least squares: the variable projection method and its applications
Golub, G., & Pereyra, V. (2003) · Inverse Problems · doi:10.1088/0266-5611/19/2/201 · Cited by 760
Locating in fingerprint space: wireless indoor localization with little human intervention
Yang, Z., Wu, C., & Liu, Y. (2012) · Proceedings of the 18th annual international conference on Mobile computing and networking · doi:10.1145/2348543.2348578 · Cited by 739
Criminisi, A. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985415 · Cited by 703
Matrices, Vector Spaces, and Information Retrieval
Berry, M. W., Drmac, Z., & Jessup, E. R. (1999) · SIAM Review · doi:10.1137/s0036144598347035 · Cited by 692
Far-UVC light (222 nm) efficiently and safely inactivates airborne human coronaviruses
Buonanno, M., Welch, D., Shuryak, I., & Brenner, D. J. (2020) · Scientific Reports · doi:10.1038/s41598-020-67211-2 · Cited by 686
Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
Neumaier, A. (1998) · SIAM Review · doi:10.1137/s0036144597321909 · Cited by 644
Hierarchical quadratic programming: Fast online humanoid-robot motion generation
Escande, A., Mansard, N., & Wieber, P.-B. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914521306 · Cited by 558
Dealing with uncertainty in model updating for damage assessment: a review
Simoen, E., De Roeck, G., & Lombaert, G. (2015) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2014.11.001 · Cited by 540
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539
Tikhonov regularization and the L-curve for large discrete ill-posed problems
Calvetti, D., Morigi, S., Reichel, L., & Sgallari, F. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00414-3 · Cited by 535
Massive MIMO Detection Techniques: A Survey
Albreem, M. A., Juntti, M., & Shahabuddin, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2935810 · Cited by 505
Estimation of parameters and eigenmodes of multivariate autoregressive models
Neumaier, A., & Schneider, T. (2001) · ACM Transactions on Mathematical Software · doi:10.1145/382043.382304 · Cited by 504
Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer
Tian, Y., Zheng, X., Zhang, X., & Jin, Y. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2906383 · Cited by 480
Bundle Adjustment in the Large
Agarwal, S., Snavely, N., Seitz, S. M., & Szeliski, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15552-9_3 · Cited by 462
Learning Multiscale Sparse Representations for Image and Video Restoration
Mairal, J., Sapiro, G., & Elad, M. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070697653 · Cited by 460
Kanoun, O., Lamiraux, F., & Wieber, P.-B. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2142450 · Cited by 405
Chou, I.-C., & Voit, E. O. (2009) · Mathematical Biosciences · doi:10.1016/j.mbs.2009.03.002 · Cited by 390
Smartphones Based Crowdsourcing for Indoor Localization
Wu, C., Yang, Z., & Liu, Y. (2015) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2014.2320254 · Cited by 383
Efficient computation of global sensitivity indices using sparse polynomial chaos expansions
Blatman, G., & Sudret, B. (2010) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2010.06.015 · Cited by 383
Recent computational developments in Krylov subspace methods for linear systems
Simoncini, V., & Szyld, D. B. (2007) · Numerical Linear Algebra with Applications · doi:10.1002/nla.499 · Cited by 375
A comparison of algorithms for fitting the PARAFAC model
Tomasi, G., & Bro, R. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.11.013 · Cited by 372
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
Keiner, J., Kunis, S., & Potts, D. (2009) · ACM Transactions on Mathematical Software · doi:10.1145/1555386.1555388 · Cited by 367
Liu, T., Wisnieff, C., Lou, M., Chen, W., Spincemaille, P., & Wang, Y. (2013) · Magnetic Resonance in Medicine · doi:10.1002/mrm.24272 · Cited by 360
Gholipour, A., Estroff, J. A., & Warfield, S. K. (2010) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2051680 · Cited by 360
Handbook of Time Series Analysis: Recent Theoretical Developments and Applications
(2006) · Wiley eBooks · doi:10.1002/9783527609970 · Cited by 360
Kim, J., He, Y., & Park, H. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0035-4 · Cited by 352
Handbook of Mathematical Methods in Imaging
(2011) · Springer eBooks · doi:10.1007/978-0-387-92920-0 · Cited by 334
Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
Baglama, J., & Reichel, L. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/04060593x · Cited by 334
Tropospheric emission spectrometer: retrieval method and error analysis
Bowman, K. W., Rodgers, C. D., Kulawik, S. S., Worden, J., Sarkissian, E., Osterman, G., Steck, T., Lou, M., Eldering, A., Shephard, M., et al. (2006) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2006.871234 · Cited by 313
(2004) · Springer eBooks · doi:10.1007/978-1-4757-4305-0 · Cited by 310
Two classes of multisecant methods for nonlinear acceleration
Fang, H., & Saad, Y. (2009) · Numerical Linear Algebra with Applications · doi:10.1002/nla.617 · Cited by 309
Generalized SURE for Exponential Families: Applications to Regularization
Eldar, Y. C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2008212 · Cited by 308
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Davis, T. A. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049670 · Cited by 271
A Modified Finite Newton Method for Fast Solution of Large Scale Linear SVMs
Keerthi, S. S., & DeCoste, D. (2005) · doi:10.5555/1046920.1088684 · Cited by 265
Proteomic analysis of Chinese hamster ovary cells
Baycin-Hizal, D., Tabb, D. L., Chaerkady, R., Chen, L., Lewis, N. E., Nagarajan, H., Sarkaria, V., Kumar, A., Wolozny, D., Colao, J., et al. (2012) · Journal of Proteome Research · doi:10.1021/pr300476w · Cited by 178
Knot tightening by constrained gradient descent
Ashton, T., Cantarella, J., Piatek, M., & Rawdon, E. J. (2011) · Experimental Mathematics · doi:10.1080/10586458.2011.544581 · Cited by 71
When the Optimal Is Not the Best: Parameter Estimation in Complex Biological Models
Fernández Slezak, D., Suárez, C., Cecchi, G. A., Marshall, G., & Stolovitzky, G. (2010) · PLoS ONE · doi:10.1371/journal.pone.0013283 · Cited by 57
“• Levenberg-Marquardt Introduced by Levenberg [2] and rediscovered by Marquardt [3], this method belongs to the optimization family called descent methods [1].”
MethodInfluentialSubgraph-preconditioned conjugate gradients for large scale SLAM
Dellaert, F., Carlson, J., Ila, V, Ni, K., & Thorpe, C. E. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5650422 · Cited by 58
“The resulting conjugate gradient (CG) method is listed as Algorithm 1 and is equivalent to the least-squares CG variant (CGLS) described by Björck in [20, page 288].”
MethodRepresenter Theorems for Sparsity-Promoting $\ell _{1}$ Regularization
Unser, M., Fageot, J., & Gupta, H. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2590421 · Cited by 36
“This allows us to deduce that (HT H + λIN )−1HT = HT (HHT + λIM )−1, which is the desired result.”
BackgroundMethodGPU acceleration of nonlinear diffusion tensor estimation using CUDA and MPI
Chang, L.-C., El-Araby, E., Dang, V. Q., & Dao, L. H. (2014) · Neurocomputing · doi:10.1016/j.neucom.2013.12.035 · Cited by 15
Exploiting the Separable Structure of SLAM
Khosoussi, K., Huang, S., & Dissanayake, G. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.023 · Cited by 14
“In the least squares literature, NLS problems with partially linear residuals are called separable [2, 13].”
Background
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 1996-11-01
- Volume
- 34
- Issue
- 03
- Pages
- 34-1602-34-1602
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2010315317
- Cited by
- 3,007
- References
- 0
- Type
- book review
- 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.