Method of solution of nonlinear programming problems
From MaRDI portal
An algorithm for solving large nonlinear programs is described. The algorithm works by applying a nonlinear conjugate directions algorithm to the standard (quadratic) augmented Lagrangian, restricted to the linearized active constraint manifold. Inequality constraints are handled by using an active set strategy. An application to optimization of a chemical engineering process is described.
Recommendations
Cited in
(15)- Simple solution procedures for nonlinear programming problems that are derivative decomposable
- An algorithm for linearly constrained programs with a partly linear objective function
- Partial linearization methods in nonlinear programming
- An ODE method of solving nonlinear programming
- A nonlinear programming technique for the optimization of continuous processing systems
- An application of constrained nonlinear programming to the physical problem: \(\mathrm{Fe-Mn}\) binary alloys
- Optimisation de procédés chimiques par une méthode de gradient réduit partie I. Présentation de l'algorithme
- scientific article; zbMATH DE number 3922390 (Why is no real title available?)
- scientific article; zbMATH DE number 3930255 (Why is no real title available?)
- scientific article; zbMATH DE number 3961363 (Why is no real title available?)
- scientific article; zbMATH DE number 4035599 (Why is no real title available?)
- scientific article; zbMATH DE number 16507 (Why is no real title available?)
- scientific article; zbMATH DE number 1263753 (Why is no real title available?)
- scientific article; zbMATH DE number 625219 (Why is no real title available?)
- scientific article; zbMATH DE number 1547872 (Why is no real title available?)
This page was built for publication: Method of solution of nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914338)