Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 612

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

Nesterov, Yu. E., Todd, M. J.·1997·Mathematics of Operations Research

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/moor.22.1.1

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Cited by

See all 612

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.