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

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

Constrained Optimization by Applying the<tex>$alpha$</tex>Constrained Method to the Nonlinear Simplex Method With Mutations

Takahama, T., Sakai, S.·2005·IEEE Transactions on Evolutionary Computation

Abstract

Constrained optimization problems are very important and frequently appear in the real world. The /spl alpha/ constrained method is a new transformation method for constrained optimization. In this method, a satisfaction level for the constraints is introduced, which indicates how well a search point satisfies the constraints. The /spl alpha/ level comparison, which compares search points based on their level of satisfaction of the constraints, is also introduced. The /spl alpha/ constrained method can convert an algorithm for unconstrained problems into an algorithm for constrained problems by replacing ordinary comparisons with the /spl alpha/ level comparisons. In this paper, we introduce some improvements including mutations to the nonlinear simplex method to search around the boundary of the feasible region and to control the convergence speed of the method, we apply the /spl alpha/ constrained method and we propose the improved /spl alpha/ constrained simplex method for constrained optimization problems. The effectiveness of the /spl alpha/ constrained simplex method is shown by comparing its performance with that of the stochastic ranking method on various constrained problems.

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.1109/tevc.2005.850256

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.

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

Cited by

See all 160

Metadata

Authors
Takahama, T., & Sakai, S.
Venue
IEEE Transactions on Evolutionary Computation
Published
2005-10
Volume
9
Issue
5
Pages
437-451
ISSN
1089-778X (ISSN-L)
OpenAlex
W2157251646
Cited by
160
References
1
FWCI
5.50
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: Constrained Optimization by Applying the<tex>$alpha$</tex>Constrained Method to the Nonlinear Simplex Method With Mutations. https://app.cochat.ai/papers/10.1109/tevc.2005.850256
The paper
Takahama, T., & Sakai, S. (2005). Constrained Optimization by Applying the<tex>$alpha$</tex>Constrained Method to the Nonlinear Simplex Method With Mutations. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2005.850256

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.