Separation process optimization calculations
DOI10.1016/0168-9274(87)90030-4zbMath0638.90088OpenAlexW2030174933WikidataQ126817300 ScholiaQ126817300MaRDI QIDQ1099788
Publication date: 1987
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(87)90030-4
Lagrangian functionsuccessive quadratic programminghybrid methodHessian matrixthermodynamic constraintsquasi- Newton approximationsseparation process optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)
Uses Software
Cites Work
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- A globally convergent method for nonlinear programming
- Least Change Secant Updates for Quasi-Newton Methods
- A New Algorithm for Unconstrained Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Separation process optimization calculations