qp() in Octave 3.0.0 returns result egregiously violating input constraints

[Joshua Redstone]

Hi Gabriele,
Thanks for your resonse.  The problematic example involves 100 variables.
What format would be most convenient for me to send it in?
I've set 'format long g' and printed out all the args to qp() that I use,
naming them as they are named in qp.m, and attached the result
to this email (gzipped).
Thanks,
Josh

On Thu, Apr 3, 2008 at 10:34 PM, Gabriele Pannocchia <
g.pannocchia at ing.unipi.it> wrote:

> Hi,
>
> > Anyone have suggestions for how to debug this further, or a fix?
> To start, it would help if you could send me the specific example.
>
> > I could write code to binary search over the maximum value of maxiter
> > that doesn't break qp(), but that would be...suboptimal. :)
>
> In the intetions of the code, each iteration should be feasible (it is
> an active set solver), so it is important to figure out when the current
> iterate becomes infeasible, rather than increasing the number of
> iterations.
>
> Thanks,
>         Gabriele
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: https://www.cae.wisc.edu/pipermail/bug-octave/attachments/20080404/492b0b6a/attachment-0001.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: bad_example.txt.gz
Type: application/x-gzip
Size: 111554 bytes
Desc: not available
Url : https://www.cae.wisc.edu/pipermail/bug-octave/attachments/20080404/492b0b6a/attachment-0001.bin