The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Minimization of functions having Lipschitz continuous first partial derivatives
Open accessOverview
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
Cites
The method of steepest descent for non-linear minimization problems
Curry, H. B. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10667 · Cited by 437
Cited by
Moderated estimation of fold change and dispersion for RNA-seq data with DESeq2
Love, M. I., Huber, W., & Anders, S. (2014) · Genome Biology · doi:10.1186/s13059-014-0550-8 · Cited by 95,106
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
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
Predictive Control for Linear and Hybrid Systems
Borrelli, F., Bemporad, A., & Morari, M. (2017) · Cambridge University Press eBooks · doi:10.1017/9781139061759 · Cited by 1,443
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
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
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
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
Direct search methods: then and now
Lewis, R. M., Torczon, V., & Trosset, M. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00423-4 · Cited by 648
Optimization Concepts and Applications in Engineering
Belegundu, A. D., & Chandrupatla, T. R. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511975905 · Cited by 555
An introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
Principles of optimal design-modeling and computation
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90173-0 · Cited by 544
Three learning phases for radial-basis-function networks
Schwenker, F., Kestler, H. A., & Palm, G. (2001) · Neural Networks · doi:10.1016/s0893-6080(01)00027-2 · Cited by 533
SSVM: A Smooth Support Vector Machine for Classification
Lee, Y.-J., & Mangasarian, O. L. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011215321374 · Cited by 518
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
The Convex Feasibility Problem in Image Recovery
Combettes, P. L. (1996) · Advances in Imaging and Electron Physics · doi:10.1016/s1076-5670(08)70157-5 · Cited by 490
A program package for simulation and parameter estimation in pharmacokinetic systems
D'argenio, D. Z., & Schumitzky, A. (1979) · Computer Programs in Biomedicine · doi:10.1016/0010-468x(79)90025-4 · Cited by 471
Control-limited differential dynamic programming
Tassa, Y., Mansard, N., & Todorov, E. (2014) · 2014 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2014.6907001 · Cited by 440
A tensor-based method for missing traffic data completion
Tan, H., Feng, G., Feng, J., Wang, W., Zhang, Y.-J., & Li, F. (2013) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2012.12.007 · Cited by 427
Economics of Electric Vehicle Charging: A Game Theoretic Approach
Tushar, W., Saad, W., Poor, H. V., & Smith, D. B. (2012) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2211901 · Cited by 410
Quasi-Newton Methods for Unconstrained Optimization
GILL, P. E., & MURRAY, W. (1972) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/9.1.91 · Cited by 359
Gradient-based algorithms with applications to signal-recovery problems
Beck, A., & Teboulle, M. (2009) · Convex Optimization in Signal Processing and Communications · doi:10.1017/cbo9780511804458.003 · Cited by 333
Reátegui, E., van der Vos, K. E., Lai, C. P., Zeinali, M., Atai, N. A., Aldikacti, B., Floyd, F. P., H. Khankhel, A., Thapar, V., Hochberg, F. H., et al. (2018) · Nature Communications · doi:10.1038/s41467-017-02261-1 · Cited by 330
Schittkowski, K. (1982) · Numerische Mathematik · doi:10.1007/bf01395810 · Cited by 273
Generative Adversarial Networks in Computer Vision: A Survey and Taxonomy
Wang, Z., She, Q., & Ward, T. E. (2022) · ACM Computing Surveys · doi:10.1145/3439723 · Cited by 267
“Lipschitz continuity [5, 36, 42] can be considered a more strict form of continuity, one which requires that the function does not change rapidly.”
BackgroundValue Function Approximation in Reinforcement Learning Using the Fourier Basis
Konidaris, G., Osentoski, S., & Thomas, P. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7903 · Cited by 267
Feedback in Flow for Accelerated Reaction Development
Reizman, B. J., & Jensen, K. F. (2016) · Accounts of Chemical Research · doi:10.1021/acs.accounts.6b00261 · Cited by 260
Generative Adversarial Networks in Computer Vision: A Survey and Taxonomy
Wang, Z., She, Q., & Ward, T. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.01529 · Cited by 255
PETSc/TAO Users Manual (Rev. 3.19)
Argonne National Laboratory (ANL), A., Balay, S., USDOE Office of Science (SC), A. S. C. R. (., Abhyankar, S., Adams, M., Benson, S., Brown, J., Brune, P., Buschelman, K., Constantinescu, E., et al. (2023) · doi:10.2172/1968587 · Cited by 67
Hard to Forget: Poisoning Attacks on Certified Machine Unlearning
Marchant, N. G., Rubinstein, B. I. P., & Alfeld, S. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i7.20736 · Cited by 64
“Following Armijo (1966) we set 𝜏 = 𝑐 = .”
AutoDMP: Automated DREAMPlace-based Macro Placement
Agnesina, A., Rajvanshi, P., Yang, T., Pradipta, G., Jiao, A., Keller, B., Khailany, B., & Ren, H. (2023) · Proceedings of the 2023 International Symposium on Physical Design · doi:10.1145/3569052.3578923 · Cited by 52
Alnowibet, K. A., Mahdi, S., El-Alem, M., Abdelawwad, M., & Mohamed, A. W. (2022) · Mathematics · doi:10.3390/math10081312 · Cited by 28
Kobler, R. J., & Scherer, R. (2016) · 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC) · doi:10.1109/smc.2016.7844284 · Cited by 20
(1996) · doi:10.1007/978-1-4615-2301-7_2 · Cited by 12
Jing, S., Chen, L., & Liu, R. (2023) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6479 · Cited by 4
Metadata
- Authors
- Armijo, L.
- Venue
- Pacific Journal of Mathematics
- Publisher
- Mathematical Sciences Publishers
- Published
- 1966-01-01
- Volume
- 16
- Issue
- 1
- Pages
- 1-3
- ISSN
- 0030-8730 (ISSN-L)
- OpenAlex
- W1969811075
- Cited by
- 1,983
- References
- 1
- FWCI
- 10.71
- Type
- journal article
- Language
- en
- Open access
- bronze
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.