Two SQP Questions: Feasibility of solutions and the "nf" return var

[JonVee]

I have a nonlinear, nonconvex, sum of squares optimization problem that I am
attempting to solve with SQP in Octave.  I have a nonlinear inequality
constraint, and box constraints on some of the variables as well.

Question 1: I initialize X_0 to be a feasible solution to my problem.  Yet,
Octave sometimes returns infeasible solutions.  Is this possible?  Would
there be a flag for this?  The "info" value is 101 (aka, terminated
normally) even for some of these infeasible solutions.

Question 2: What does the "nf" return variable stand for?  I can't find this
anywhere in the documentation or online.

Thank you,

Jon

--
View this message in context: 
http://octave.1599824.n4.nabble.com/Two-SQP-Questions-Feasibility-of-solutions-and-the-nf-return-var-tp3681177p3681177.html
Sent from the Octave - General mailing list archive at Nabble.com.