5 search results - page 1 / 1 » Modifying SQP for Degenerate Problems |
SIAMJO
2002
13 years 4 months ago
2002
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
SIAMNUM
2010
12 years 11 months ago
2010
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
JSCIC
2006
13 years 4 months ago
2006
We improve upon a method introduced in (Bertalmio et. al. JCP 2001) for solving evolution PDEs on codimension-one surfaces in RN. As in the original method, by representing the su...
VIS
2004
IEEE
14 years 6 months ago
2004
IEEE
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
ESSMAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...