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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Optimization by direct search and systematic reduction of the size of search region

Luus, Rein, Jaakola, T. H. I. · 1973 · AIChE Journal

Abstract

A direct search procedure utilizing pseudo random numbers over a region is presented to solve nonlinear programming problems. After each iteration the size of the region is reduced so that the optimum can be found as accurately as desired. The ease of programming, the speed of convergence, and the reliability of results make the procedure very attractive for solving nonlinear programming problems.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1002/aic.690190413

Cites

1 of 1 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 1 references

Cited by

See all 450

Metadata

Authors
Luus, R., & Jaakola, T. H. I.
Venue
AIChE Journal
Publisher
Wiley
Published
1973-07
Volume
19
Issue
4
Pages
760-766
ISSN
  • 0001-1541 (ISSN-L)
  • 1547-5905
OpenAlex
W2049850279
Cited by
450
References
1
FWCI
8.17
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: Optimization by direct search and systematic reduction of the size of search region. https://app.cochat.ai/papers/10.1002/aic.690190413
The paper
Luus, R., & Jaakola, T. H. I. (1973). Optimization by direct search and systematic reduction of the size of search region. AIChE Journal. https://doi.org/10.1002/aic.690190413

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.