Proof of Convergence for a Modification of Goldfarb's Algorithm

Published Online:https://doi.org/10.1287/moor.6.2.233

A variable metric algorithm for minimization problems under linear inequality constraints similar to that of Goldfarb is constructed and shown to be superlinearly convergent.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.