998 search results - page 6 / 200 » From Feasible Proofs to Feasible Computations |
SIAMJO
2008
13 years 7 months ago
2008
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
CONCUR
2012
Springer
11 years 9 months ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
DISOPT
2007
13 years 7 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
COR
2008
13 years 7 months ago
2008
Whether a given nonlinear solver can reach a feasible point for a set of nonlinear constraints depends heavily on the initial point provided. We develop a range of computationally...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...