Search Results

We extend a sequential quadratic programming method for equality constrained optimization to the setting of Hilbert manifolds. The use of retractions and linearizing maps allows us to pull back the functional and the constraint mapping to linear spaces ...

Existing multigrid methods for cloth simulation are based on geometric multigrid. While good results have been reported, geometric methods are problematic for unstructured grids, widely varying material properties, and varying anisotropies, and they ...

A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness ...

The problem of minimizing a quadratic function subject to an ellipsoidal constraint when the matrix involved is the Hessian of a quadratic penalty function (i.e., a function of the form $p(x) = f(x) + (1/2\mu )c(x)^T c(x)$) is considered. Most ...