This is a preview. Log in through your library . Abstract In some applications linear approximations to non-linear models are desirable. They bring the benefits of computational simplicity and access ...

A modified version of Generalized Programming is presented for solving convex programming problems. The procedure uses convenient linear approximations of the gradient of the dual in order to ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...