The DOI matches its Crossref record.
Variational Analysis
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Conditional value-at-risk for general loss distributions
Rockafellar, R. T., & Uryasev, S. (2002) · Journal of Banking & Finance · doi:10.1016/s0378-4266(02)00271-6 · Cited by 3,820
Self-citationA New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064
Goebel, R., Sanfelice, R. G., & Teel, A. R. (2009) · IEEE Control Systems · doi:10.1109/mcs.2008.931718 · Cited by 1,656
Discontinuous dynamical systems
(2008) · IEEE Control Systems · doi:10.1109/mcs.2008.919306 · Cited by 1,068
A coordinate gradient descent method for nonsmooth separable minimization
Tseng, P., & Yun, S. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0170-0 · Cited by 728
Solving inverse problems using data-driven models
Arridge, S., Maass, P., Öktem, O., & Schönlieb, C.-B. (2019) · Acta Numerica · doi:10.1017/s0962492919000059 · Cited by 686
Generalized Nash equilibrium problems
Facchinei, F., & Kanzow, C. (2007) · 4OR · doi:10.1007/s10288-007-0054-4 · Cited by 591
Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications
Pagnoncelli, B. K., Ahmed, S., & Shapiro, A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9523-6 · Cited by 523
Capacity Bounds for the Gaussian Interference Channel
Motahari, A. S., & Khandani, A. K. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009807 · Cited by 430
Risk-averse dynamic programming for Markov decision processes
Ruszczyński, A. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0393-3 · Cited by 415
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
Ghadimi, S., Lan, G., & Zhang, H. (2016) · Mathematical Programming · doi:10.1007/s10107-014-0846-1 · Cited by 376
Unsupervised Curve Clustering using B‐Splines
Abraham, C., Cornillon, P. A., Matzner‐Løber, E., & Molinari, N. (2003) · Scandinavian Journal of Statistics · doi:10.1111/1467-9469.00350 · Cited by 359
AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
Ben‐Tal, A., & Teboulle, M. (2007) · Mathematical Finance · doi:10.1111/j.1467-9965.2007.00311.x · Cited by 353
Nonsmooth optimization via quasi-Newton methods
Lewis, A. S., & Overton, M. L. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0514-2 · Cited by 352
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
Leventhal, D., & Lewis, A. S. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0456 · Cited by 349
Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
Wang, G., Giannakis, G. B., & Eldar, Y. C. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756858 · Cited by 330
Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Liang, S., Yi, P., & Hong, Y. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.064 · Cited by 328
Nikolova, M. (2002) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142901389165 · Cited by 326
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Scutari, G., Facchinei, F., & Lampariello, L. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2637317 · Cited by 314
Invariance Principles for Hybrid Systems With Connections to Detectability and Asymptotic Stability
Sanfelice, R. G., Goebel, R., & Teel, A. R. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.910684 · Cited by 312
Smoothing methods for nonsmooth, nonconvex minimization
Chen, X. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0569-0 · Cited by 295
Impulse differential inclusions: a viability approach to hybrid systems
Aubin, J.-P., Lygeros, J., Quincampoix, M., Sastry, S., & Seube, N. (2002) · IEEE Transactions on Automatic Control · doi:10.1109/9.981719 · Cited by 284
Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
Drusvyatskiy, D., & Lewis, A. S. (2018) · Mathematics of Operations Research · doi:10.1287/moor.2017.0889 · Cited by 267
Model predictive control: for want of a local control Lyapunov function, all is not lost
Grimm, G., Messina, M. J., Tuna, S. E., & Teel, A. R. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.847055 · Cited by 262
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
Oymak, S., Jalali, A., Fazel, M., Eldar, Y. C., & Hassibi, B. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2401574 · Cited by 252
Smoothed -Minimization for Green Cloud-RAN With User Admission Control
Shi, Y., Cheng, J., Zhang, J., Bai, B., Chen, W., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2544578 · Cited by 70
Robust Group Sparse Beamforming for Multicast Green Cloud-RAN With Imperfect CSI
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2442957 · Cited by 63
Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks With CSI Uncertainty
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385669 · Cited by 61
Metadata
- Authors
- Rockafellar, R. T., & Wets, R. J. B.
- Venue
- Grundlehren der mathematischen Wissenschaften
- Publisher
- Springer Berlin Heidelberg
- Published
- 1998
- ISSN
- 0072-7830 (ISSN-L)
- OpenAlex
- W4249513058
- Cited by
- 4,086
- References
- 0
- FWCI
- 7.83
- Type
- book
- Language
- de
- 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.