The DOI matches its Crossref record.
Nonlinear Programming: A Unified Approach
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
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
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
Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs
Marks, B. R., & Wright, G. P. (1978) · Operations Research · doi:10.1287/opre.26.4.681 · Cited by 985
Low-rank matrix completion using alternating minimization
Jain, P., Netrapalli, P., & Sanghavi, S. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488693 · Cited by 817
A Statistical Model for Positron Emission Tomography
Vardi, Y., Shepp, L. A., & Kaufman, L. (1985) · Journal of the American Statistical Association · doi:10.1080/01621459.1985.10477119 · Cited by 863
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744
Sum Power Iterative Water-Filling for Multi-Antenna Gaussian Broadcast Channels
Jindal, N., Rhee, W., Vishwanath, S., Jafar, S. A., & Goldsmith, A. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844082 · Cited by 622
Principles of optimal design-modeling and computation
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90173-0 · Cited by 544
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
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
Fuzzy c-means clustering of incomplete data
Hathaway, R. J., & Bezdek, J. C. (2001) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.956035 · Cited by 490
Iterative Reweighted $\ell_1$ and $\ell_2$ Methods for Finding Sparse Solutions
Wipf, D., & Nagarajan, S. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042413 · Cited by 448
The segmental K-means algorithm for estimating parameters of hidden Markov models
Juang, B.-H., & Rabiner, L. R. (1990) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.60082 · Cited by 409
Game Theory for Wireless Engineers
MacKenzie, A. B., & DaSilva, L. A. (2006) · Synthesis lectures on communications · doi:10.2200/s00014ed1v01y200508com001 · Cited by 390
Continuous equilibrium network design models
Abdulaal, M., & LeBlanc, L. J. (1979) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(79)90004-3 · Cited by 386
Empirical Distributions in Selection Bias Models
Vardi, Y. (1985) · The Annals of Statistics · doi:10.1214/aos/1176346585 · Cited by 382
Optimal insurance and generalized deductibles
Arrow, K. J. (1974) · Scandinavian Actuarial Journal · doi:10.1080/03461238.1974.10408659 · Cited by 373
Tao, D., Li, X., Hu, W., Maybank, S., & Wu, X. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.139 · Cited by 373
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
Bertsekas, D. P. (1976) · Automatica · doi:10.1016/0005-1098(76)90077-7 · Cited by 347
Collaborative Fuzzy Clustering From Multiple Weighted Views
Jiang, Y., Chung, F.-L., Wang, S., Deng, Z., Wang, J., & Qian, P. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2334595 · Cited by 279
On Tensors, Sparsity, and Nonnegative Factorizations
Chi, E. C., & Kolda, T. G. (2012) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110859063 · Cited by 274
FFT-Based Efficient Algorithms for Time Delay Estimation
Wu, R., Wang, W., & Ji, Q. (2012) · Fourier Transform - Signal Processing · doi:10.5772/36242 · Cited by 2
Metadata
- Authors
- Peterson, D. W., & Zangwill, W. I.
- Venue
- Econometrica
- Publisher
- JSTOR
- Published
- 1972-03
- Volume
- 40
- Issue
- 2
- Pages
- 411
- ISSN
- 0012-9682 (ISSN-L)
- OpenAlex
- W2038614136
- Cited by
- 1,005
- References
- 0
- FWCI
- 34.69
- 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.