Results 1  10
of
2,672
The geometry of algorithms with orthogonality constraints
 SIAM J. MATRIX ANAL. APPL
, 1998
"... In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal proces ..."
Abstract

Cited by 640 (1 self)
 Add to MetaCart
In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 597 (24 self)
 Add to MetaCart
derivatives are available, and that the constraint gradients are sparse. We discuss
High Accuracy Optical Flow Estimation Based on a Theory for Warping
, 2004
"... We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discontinuitypreserving spatiotemporal smoothness constraint. ..."
Abstract

Cited by 509 (45 self)
 Add to MetaCart
We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discontinuitypreserving spatiotemporal smoothness constraint.
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
the gradientprojection method. This amounts to solving a time dependent partial differential equation on a manifold determined by the constraints. As t ~ 0o the solution converges to a steady state which is the denoised image. The numerical algorithm is simple and relatively fast. The results appear
Large steps in cloth simulation
 SIGGRAPH 98 Conference Proceedings
, 1998
"... The bottleneck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably take large time steps. The simulation system couples a new technique for enforcing constraints on individual cloth particle ..."
Abstract

Cited by 576 (5 self)
 Add to MetaCart
as well. The implicit integration method generates a large, unbanded sparse linear system at each time step which is solved using a modified conjugate gradient method that simultaneously enforces particles ’ constraints. The constraints are always maintained exactly, independent of the number of conjugate
Constraint Gradient Projective Method for Stabilized Dynamic Simulation of Constrained Multibody Systems
 ASME International Design Engineering Technical Conferences, DETC2003/VIB48314
, 2003
"... Constraint gradient projective method for stabilization of constraint violation during integration of constrained multibody systems is in the focus of the paper. Different mathematical models for constrained MBS dynamic simulation on manifolds are surveyed and violation of kinematical constraints is ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Constraint gradient projective method for stabilization of constraint violation during integration of constrained multibody systems is in the focus of the paper. Different mathematical models for constrained MBS dynamic simulation on manifolds are surveyed and violation of kinematical constraints
Empirical tests of the Gradual Learning Algorithm
 LINGUISTIC INQUIRY 32.45–86
, 2001
"... The Gradual Learning Algorithm (Boersma 1997) is a constraint ranking algorithm for learning Optimalitytheoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and Smol ..."
Abstract

Cited by 383 (37 self)
 Add to MetaCart
The Gradual Learning Algorithm (Boersma 1997) is a constraint ranking algorithm for learning Optimalitytheoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar
Projected gradient methods for Nonnegative Matrix Factorization
 Neural Computation
, 2007
"... Nonnegative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. Although boundconstrained optimization has been studied extensively in both theory and practice, so far no study has formally applied its techniques to NMF. In this paper, we propose two proj ..."
Abstract

Cited by 282 (2 self)
 Add to MetaCart
Nonnegative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. Although boundconstrained optimization has been studied extensively in both theory and practice, so far no study has formally applied its techniques to NMF. In this paper, we propose two
Probing the Pareto frontier for basis pursuit solutions
, 2008
"... The basis pursuit problem seeks a minimum onenorm solution of an underdetermined leastsquares problem. Basis pursuit denoise (BPDN) fits the leastsquares problem only approximately, and a single parameter determines a curve that traces the optimal tradeoff between the leastsquares fit and the ..."
Abstract

Cited by 365 (5 self)
 Add to MetaCart
on this curve; the algorithm is suitable for problems that are large scale and for those that are in the complex domain. At each iteration, a spectral gradientprojection method approximately minimizes a leastsquares problem with an explicit onenorm constraint. Only matrixvector operations are required
A Variational Level Set Approach to Multiphase Motion
 JOURNAL OF COMPUTATIONAL PHYSICS 127, 179–195 (1996) ARTICLE NO. 0167
, 1996
"... A coupled level set method for the motion of multiple junctions (of, e.g., solid, liquid, and grain boundaries), which follows the gradient flow for an energy functional consisting of surface tension (proportional to length) and bulk energies (proportional to area), is sin �1 developed. The approach ..."
Abstract

Cited by 315 (38 self)
 Add to MetaCart
functions. The j � j�; see Fig. 1. gradient projection method leads to a coupled system of perturbed (by curvature terms) Hamilton–Jacobi equations. The coupling is enforced using a single Lagrange multiplier associated with a constraint which essentially prevents (a) regions from overlapping and (b
Results 1  10
of
2,672