We present a model-based derivative-free method for optimization subject to general convex constraints, which we assume are unrelaxable and accessed only through projection operator that is cheap evaluate. prove global convergence worst-case complexity of $O(\epsilon^{-2})$ iterations objective evaluations nonconvex functions, matching results the unconstrained case. introduce new, weaker requi...

Based on analysis of basic cubic spline interpolation, the clamped cubic spline interpolation is generalized in this paper. The methods are presented on the condition that the first derivative and second derivative of arbitrary node are given. The Clamped spline and Curvature-adjusted cubic spline are also generalized. The methods are presented on the condition that the first derivatives of arb...