The constrained nonlinear programming methods, always named by the caller (F_0066).
Never a hidden default, the c2d rule: on a non-convex problem the two can stop at different KKT points, so a silent choice would make two correct-looking answers disagree.
Sequential quadratic programming: one qpSolve per iteration on the linearised constraints, a damped-BFGS Hessian, an ℓ₁ merit line search with a second-order correction.
Sequential quadratic programming: one qpSolve per iteration on the linearised constraints, a damped-BFGS Hessian, an ℓ₁ merit line search with a second-order correction.