<table cellspacing="0" cellpadding="0" border="0" ><tr><td valign="top" style="font: inherit;"><br><br><div id="yiv347057443"><table border="0" cellpadding="0" cellspacing="0"><tbody><tr><td style="font-family: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; font-size: inherit; line-height: inherit; font-size-adjust: inherit; font-stretch: inherit; -x-system-font: none;" valign="top"><div id="yiv238136965">Hello,<br><br>I am using the Coin-Or Clp.<br>I would like to know more about the Reduced Gradient method which is used for solving Quadratic programming problem in Clp.<br><br>I have got the documentation which is refereed in the Clp source code:<br> <span style="font-style: italic;"><br style="font-style: italic;"></span><span style="font-style: italic;"> Forrest and Tomlin, Implementing the simplex method for</span><br style="font-style: italic;"><span style="font-style:
italic;"> the Optimization Subroutine
Library - IBM Systems Journal 1992</span><br><br style="font-style: italic;"><span style="font-style: italic;"> Gill, Murray, Saunders, Wright A Practical Anti-Cycling</span><br style="font-style: italic;"><span style="font-style: italic;"> Procedure for Linear and Nonlinear Programming SOL report 1988</span><br><br>But that documentation mainly discourse numerical issues and corner cases.<br><br>Could someone please refer a documentation which will describe the Reduced Gradient Method for Quadratic Programming problem implemented in Clp.<br><br>Thanks in Advance,<br><span style="background: transparent none repeat scroll 0% 0%; -moz-background-clip: border; -moz-background-origin: padding; -moz-background-inline-policy: continuous; cursor: pointer;" class="yshortcuts" id="lw_1257166283_1">Armen Nahapetyan</span><br><br><br></div></td></tr></tbody></table><br>
</div></td></tr></table><br>