The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Abstract
This paper provides a theoretical foundation for efficient interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled. For such problems we devise long-step and symmetric primal-dual methods. Because of the special properties of these cones and barriers, our algorithms can take steps that go typically a large fraction of the way to the boundary of the feasible region, rather than being confined to a ball of unit radius in the local norm defined by the Hessian of the barrier.
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
Cites
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Self-citationConvex Analysis and Variational Problems
(1976) · Studies in Mathematics and Its Applications · doi:10.1016/c2009-0-19672-1 · Cited by 3,806
An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems
Kojima, M., Mizuno, S., & Yoshise, A. (1991) · Mathematical Programming · doi:10.1007/bf01594942 · Cited by 173
Potential Reduction Polynomial Time Method for Truss Topology Design
Ben‐Tal, A., & Nemirovski, A. S. (1994) · SIAM Journal on Optimization · doi:10.1137/0804033 · Cited by 46
Cited by
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Solving semidefinite-quadratic-linear programs using SDPT3
T�t�nc�, R. H., Toh, K. C., & Todd, M. J. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0347-5 · Cited by 1,152
Self-citationDisciplined 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
Metadata
- Authors
- Nesterov, Y. E., & Todd, M. J.
- Venue
- Mathematics of Operations Research
- Published
- 1997-02
- Volume
- 22
- Issue
- 1
- Pages
- 1-42
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2117065890
- Cited by
- 612
- References
- 5
- FWCI
- 28.38
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Self-Scaled Barriers and Interior-Point Methods for Convex Programming. https://app.cochat.ai/papers/10.1287/moor.22.1.1
- The paper
- Nesterov, Y. E., & Todd, M. J. (1997). Self-Scaled Barriers and Interior-Point Methods for Convex Programming. Mathematics of Operations Research. https://doi.org/10.1287/moor.22.1.1
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.