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

The DOI matches its Crossref record.

A New Method of Constrained Optimization and a Comparison With Other Methods

Box, M. J.·1965·The Computer Journal

Abstract

A new method for finding the maximum of a general non-linear function of several variables within a constrained region is described, and shown to be efficient compared with existing methods when the required optimum lies on one or more constraints. The efficacy of using effective constraints to eliminate variables is demonstrated, and a program to achieve this easily and automatically is described. Finally, the performance of the new method (the “Complex” method) with unconstrained problems, is compared with those of the Simplex method, from which it was evolved, and Rosenbrock's method.

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.1093/comjnl/8.1.42

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.

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.

Metadata

Authors
Box, M. J.
Venue
The Computer Journal
Published
1965-04-01
Volume
8
Issue
1
Pages
42-52
ISSN
  • 0010-4620 (ISSN-L)
  • 1460-2067
OpenAlex
W2163918103
Cited by
1,302
References
0
FWCI
3.23
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: A New Method of Constrained Optimization and a Comparison With Other Methods. https://app.cochat.ai/papers/10.1093/comjnl/8.1.42
The paper
Box, M. J. (1965). A New Method of Constrained Optimization and a Comparison With Other Methods. The Computer Journal. https://doi.org/10.1093/comjnl/8.1.42

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.