The DOI matches its Crossref record.
A Mathematical View of Interior-Point Methods in Convex Optimization
Abstract
These lecture notes aim at developing a thorough understanding of the core theory for interior-point methods. The overall theory continues to grow ata rapid rate but the core ideas have remained largely unchanged for several years, since Nesterov and Nemirovskii [1] published their path-breaking, broadly-encompassing and enormously influential work. Since then, what has changed about the core ideas is our conception of them. Whereas [1] is notoriously difficult reading even for specialists, we now know how to motivate and present the general theory in such away as to make it accessible for non-specialists and PhD students. Therein lies the justification for these lecture notes. We develop the theory in R^n although most of the theory can be developed in arbitrary real Hilbert spaces. The restriction to finite dimensions is primarily for accessibility. The notes were developed largely in conjunction with a PhD-level course on interior-point methods at Cornell University.
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
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Nesterov, Y. (2012) · SIAM Journal on Optimization · doi:10.1137/100802001 · Cited by 1,187
Random Gradient-Free Minimization of Convex Functions
Nesterov, Y., & Spokoiny, V. (2017) · Foundations of Computational Mathematics · doi:10.1007/s10208-015-9296-2 · Cited by 822
Potra, F. A., & Wright, S. J. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00433-7 · Cited by 726
Sums of Squares, Moment Matrices and Optimization Over Polynomials
Laurent, M. (2009) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-0-387-09686-5_7 · Cited by 648
Generalized power method for sparse principal component analysis
Journée, M., Nesterov, Y. E., Richtárik, P., & Sepulchre, R. J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.4724 · Cited by 473
Metadata
- Authors
- Renegar, J.
- Venue
- Society for Industrial and Applied Mathematics eBooks
- Published
- 2001-01
- OpenAlex
- W2165323796
- Cited by
- 631
- References
- 0
- FWCI
- 9.49
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Mathematical View of Interior-Point Methods in Convex Optimization. https://app.cochat.ai/papers/10.1137/1.9780898718812
- The paper
- Renegar, J. (2001). A Mathematical View of Interior-Point Methods in Convex Optimization. Society for Industrial and Applied Mathematics eBooks. https://doi.org/10.1137/1.9780898718812
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.