An extension of the simplex method to constrained nonlinear optimization
From MaRDI portal
Publication:1106727
DOI10.1007/BF00941060zbMath0651.90062MaRDI QIDQ1106727
Publication date: 1989
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
constrained optimization; function minimization; inequality and equality constraints; delayed reflection; Nelder-Mead simplex algorithm
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
Related Items
Solving constrained optimization problems using a novel genetic algorithm, Evaluation of the simplex method for training simple multilayer neural networks, Trajectory generation under constraints by linearization method
Cites Work
- Unnamed Item
- A new augmented Lagrangian function for inequality constraints in nonlinear programming problems
- An accelerated multiplier method for nonlinear programming
- A New Method of Constrained Optimization and a Comparison With Other Methods
- A Simplex Method for Function Minimization
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation