The DOI matches its Crossref record.
Convex Analysis
Abstract
Available for the first time in paperback, R. Tyrrell Rockafellar's classic study presents readers with a coherent branch of nonlinear mathematical analysis that is especially suited to the study of optimization problems. Rockafellar's theory differs from classical analysis in that differentiability assumptions are replaced by convexity assumptions. The topics treated in this volume include: systems of inequalities, the minimum or maximum of a convex function over a convex set, Lagrange multipliers, minimax theorems and duality, as well as basic results about the structure of convex sets and the continuity and differentiability of convex functions and saddle- functions. This book has firmly established a new and vital area not only for pure mathematics but also for applications to economics and engineering. A sound knowledge of linear algebra and introductory real analysis should provide readers with sufficient background for this book. There is also a guide for the reader who may be using the book as an introduction, indicating which parts are essential and which may be skipped on a first reading.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559
Wright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Entanglement measures and purification procedures
Vedral, V., & Plenio, M. B. (1998) · Physical Review A · doi:10.1103/physreva.57.1619 · Cited by 1,419
Fast Image Recovery Using Variable Splitting and Constrained Optimization
Afonso, M. V., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2047910 · Cited by 1,223
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Nonlinear image recovery with half-quadratic regularization
Geman, D., & Yang, C. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.392335 · Cited by 1,000
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814
Bell inequalities and the separability criterion
Terhal, B. M. (2000) · Physics Letters A · doi:10.1016/s0375-9601(00)00401-1 · Cited by 775
Scheduling Policies for Federated Learning in Wireless Networks
Yang, H. H., Liu, Z., Quek, T. Q. S., & Poor, H. V. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2944169 · Cited by 640
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
Fidelity and concurrence of conjugated states
Uhlmann, A. (2000) · Physical Review A · doi:10.1103/physreva.62.032307 · Cited by 421
Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization
Nguyen, X., Wainwright, M. J., & Jordan, M. I. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068870 · Cited by 379
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
DRAWDOWN MEASURE IN PORTFOLIO OPTIMIZATION
CHEKHLOV, A., URYASEV, S., & ZABARANKIN, M. (2005) · International Journal of Theoretical and Applied Finance · doi:10.1142/s0219024905002767 · Cited by 350
Robust Markov Decision Processes
Wiesemann, W., Kuhn, D., & Rustem, B. (2013) · Mathematics of Operations Research · doi:10.1287/moor.1120.0566 · Cited by 312
Finding approximate POMDP solutions through belief compression
Roy, N., Gordon, G., & Thrun, S. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1496 · Cited by 254
The Isotonic Regression Problem and its Dual
Barlow, R. E., & Brunk, H. D. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481216 · Cited by 245
A fibre bundle over manifolds of quantum channels and its application to quantum statistics
Fujiwara, A., & Imai, H. (2008) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/41/25/255304 · Cited by 163
Identifiability of chemical reaction networks
Craciun, G., & Pantea, C. (2008) · Journal of Mathematical Chemistry · doi:10.1007/s10910-007-9307-x · Cited by 146
Wireless-Powered Over-the-Air Computation in Intelligent Reflecting Surface-Aided IoT Networks
Wang, Z., Shi, Y., Zhou, Y., Zhou, H., & Zhang, N. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3015489 · Cited by 131
Microeconometrics with partial identification
(2020) · Handbook of Econometrics · doi:10.1016/bs.hoe.2020.05.002 · Cited by 99
Distributed Non-Autonomous Power Control through Distributed Convex Optimization
Ram, S. S., Veeravalli, V. V., & Nedic, A. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5062275 · Cited by 99
Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
Gambella, C., & Simonetto, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3033139 · Cited by 60
Smith, Z., Strobel, M., Vani, B. P., & Tiwary, P. (2024) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.3c01698 · Cited by 47
Robustness in Experiment Design
Rojas, C. R., Aguero, J.-C., Welsh, J. S., Goodwin, G. C., & Feuer, A. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2166294 · Cited by 27
Does Speculation in Financial Markets Have Real Effects?
Li, T., & Loewenstein, M. (2014) · doi:10.2139/ssrn.2423360 · Cited by 4
Metadata
- Authors
- Rockafellar, R. T.
- Venue
- Princeton University Press eBooks
- Publisher
- Princeton University Press
- Published
- 1970-12-31
- OpenAlex
- W4249667877
- Cited by
- 10,801
- References
- 0
- FWCI
- 23.12
- Type
- book
- 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.
