An extension of the simplex method to constrained nonlinear optimization (Q1106727): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Simplex Method for Function Minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Method of Constrained Optimization and a Comparison With Other Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4060751 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An accelerated multiplier method for nonlinear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new augmented Lagrangian function for inequality constraints in nonlinear programming problems / rank | |||
Normal rank |
Latest revision as of 18:23, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An extension of the simplex method to constrained nonlinear optimization |
scientific article |
Statements
An extension of the simplex method to constrained nonlinear optimization (English)
0 references
1989
0 references
The simplex algorithm of \textit{J. A. Nelder} and \textit{R. Mead} [Computer J. 7, 308-313 (1965; Zbl 0229.65053)] is extended to handle nonlinear optimization problems with constraints. To prevent the simplex from collapsing into a subspace near the constraints, a delayed reflection is introduced for those points moving into the infeasible region. Numerical experience indicates that the proposed algorithm yields good results in the presence of both inequality and equality constraints, even when the constraint region is narrow. We note that it may be possible to modify and improve the algorithm by trying out variants.
0 references
function minimization
0 references
constrained optimization
0 references
Nelder-Mead simplex algorithm
0 references
delayed reflection
0 references
inequality and equality constraints
0 references