Sciweavers

14 search results - page 3 / 3
» Mathematical programs with vanishing constraints: optimality...
Sort
View
SIAMJO
2002
99views more  SIAMJO 2002»
13 years 6 months ago
On the Calmness of a Class of Multifunctions
The paper deals with the calmness of a class of multifunctions in finite dimensions. Its first part is devoted to various conditions for calmness, which are derived in terms of cod...
René Henrion, Abderrahim Jourani, Jir&iacut...
TNN
2010
182views Management» more  TNN 2010»
13 years 1 months ago
A discrete-time neural network for optimization problems with hybrid constraints
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
Huajin Tang, Haizhou Li, Zhang Yi
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CASES
2004
ACM
13 years 11 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...