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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback