Sciweavers

4324 search results - page 6 / 865
» A Generalized Representer Theorem
Sort
View
MP
2010
157views more  MP 2010»
13 years 5 months ago
Newton's method for generalized equations: a sequential implicit function theorem
In the extension of Newton’s method to generalized equations, applying to variational inequalities as a special case, convergence analysis relates to a corresponding implicit fun...
Asen L. Dontchev, R. Tyrrell Rockafellar
DISOPT
2008
81views more  DISOPT 2008»
13 years 7 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
FASE
2000
Springer
13 years 11 months ago
More About TAS and IsaWin - Tools for Formal Program Development
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...
Christoph Lüth, Burkhart Wolff
CADE
2001
Springer
14 years 7 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester
JCT
2010
79views more  JCT 2010»
13 years 2 months ago
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
Rudi Pendavingh, Stefan H. M. van Zwam