The numerical solution of bilinear data reconciliation problems using unconstrained optimization methods

A new approach to solving steady state data reconciliation problems with bilinear constraints is proposed. Previously it was shown by Crowe that these problems can be solved using the method of matrix projection. In this work the objective function and its constraints are put into unconstrained form...

Full description

Saved in:
Bibliographic Details
Published in:Computers & chemical engineering 1996, Vol.20, p.S727-S732
Main Authors: Schraa, Oliver J., Crowe, Cameron M.
Format: Article
Language:English
Subjects:
Applied sciences
Chemical engineering
Exact sciences and technology
Metrology, automation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new approach to solving steady state data reconciliation problems with bilinear constraints is proposed. Previously it was shown by Crowe that these problems can be solved using the method of matrix projection. In this work the objective function and its constraints are put into unconstrained form using Lagrange multipliers. Unconstrained optimization methods based on analytical derivatives are then used to solve the unconstrained formulation. The unconstrained approach is tested on two different reconciliation problems from the literature using a number of Newton-type unconstrained optimization methods. The unconstrained methods are compared in terms of robustness and efficiency in solving the example problems. The performance of the unconstrained approach is compared to that of the method of matrix projection and the projected Lagrangian algorithm implemented in GAMS/MINOS.
ISSN:0098-1354
1873-4375
DOI:10.1016/0098-1354(96)00130-5