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.











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)