5864 search results - page 79 / 1173 » Can We Work around Numerical Methods |
148
click to vote
SIAMJO
2008
15 years 3 months ago
2008
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
252
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
149
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
With semiconductor fabrication technologies scaled below 100 nm, the design-manufacturing interface becomes more and more complicated. The resultant process variability causes a nu...
122
Voted
AUTOMATICA
2007
15 years 4 months ago
2007
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
139
Voted
MOC
1998
15 years 3 months ago
1998
In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite ele...