An extension of the simplex method to constrained nonlinear optimization

DOI10.1007/BF00941060zbMath0651.90062MaRDI QIDQ1106727

M. Bala Subrahmanyam

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

constrained optimizationfunction minimizationinequality and equality constraintsdelayed reflectionNelder-Mead simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (5)

Trajectory generation under constraints by linearization method ⋮ Solving constrained optimization problems using a novel genetic algorithm ⋮ Evaluation of the simplex method for training simple multilayer neural networks ⋮ Fractional Multi-models of the Frog Gastrocnemius Muscle ⋮ The CRONE control of resonant plants: application to a flexible transmission

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

This page was built for publication: An extension of the simplex method to constrained nonlinear optimization