63 citations · 64 across the 2 of their papers we have counts for
2 papers
math.OC2014★ 1 cited
An elementary proof of linear programming optimality conditions without using Farkas' lemma
Anders Forsgren, Margaret H. Wright
Although it is easy to prove the sufficient conditions for optimality of a linear program, the necessary conditions pose a pedagogical challenge. A widespread practice in deriving…
math.OC2011★ 63 cited
Convergence of the restricted Nelder-Mead algorithm in two dimensions
Jeffrey C. Lagarias, Bjorn Poonen, Margaret H. Wright
The Nelder-Mead algorithm, a longstanding direct search method for unconstrained optimization published in 1965, is designed to minimize a scalar-valued function f of n real variab…