519 search results - page 60 / 104 » A New Approach to Strongly Polynomial Linear Programming |
SIAMJO
2002
15 years 1 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...
119
click to vote
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
118
click to vote
COCOON
2003
Springer
15 years 6 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
111
click to vote
COCO
2007
Springer
15 years 5 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
105
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...