Results 1  10
of
4,048
Properties of Tree Convex Constraints
"... Abstract It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it may not make it globally consistent. In this paper, we investigate the properties of some tree convex constrain ..."
Abstract
 Add to MetaCart
constraints under intersection and composition. As a result, we identify a subclass of tree convex networks that are locally chain convex and strictly union closed. This class of problems can be made globally consistent by arc and path consistency and thus is tractable. Interestingly, we also find that some
Farkastype results and duality for DC programs with convex constraints
 J. Convex Anal
"... convex constraints ..."
Variational Problems with Convexity Constraints ∗
, 2008
"... We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivator behind this numerical method is estimating solutions to Adverse Selection problems within a PrincipalAgent framework. Problems such as prod ..."
Abstract
 Add to MetaCart
We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivator behind this numerical method is estimating solutions to Adverse Selection problems within a PrincipalAgent framework. Problems
MINIMUM MSE ESTIMATION WITH CONVEX CONSTRAINTS
"... We address the problem of minimum meansquared error (MMSE) estimation under convex constraints. The familiar orthogonality principle, developed for linear constraints, is generalized to include convex restrictions. Using the extended principle, we study two types of convex constraints: constraints ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We address the problem of minimum meansquared error (MMSE) estimation under convex constraints. The familiar orthogonality principle, developed for linear constraints, is generalized to include convex restrictions. Using the extended principle, we study two types of convex constraints: constraints
Properties of programs with monotone and convex constraints
 In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI05
, 2005
"... We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include tight programs and Fages Lemma, program completion and loop formulas, and the notions of strong and uniform equivalence with their char ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include tight programs and Fages Lemma, program completion and loop formulas, and the notions of strong and uniform equivalence
Subdifferential conditions for calmness of convex constraints
 SIAM J. Optim
"... Abstract. We study subdifferential conditions of the calmness property for multifunctions representing convex constraint systems in a Banach space. Extending earlier work in finite dimensions [R. Henrion and J. Outrata, J. Math. Anal. Appl., 258 (2001), pp. 110–130], we show that, in contrast to the ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Abstract. We study subdifferential conditions of the calmness property for multifunctions representing convex constraint systems in a Banach space. Extending earlier work in finite dimensions [R. Henrion and J. Outrata, J. Math. Anal. Appl., 258 (2001), pp. 110–130], we show that, in contrast
Tractable Tree Convex Constraint Networks
, 2004
"... A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the values allowed for the other variable form a subtree of the constructed tree. It is known that a tree convex network is g ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the values allowed for the other variable form a subtree of the constructed tree. It is known that a tree convex network
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5411 (68 self)
 Add to MetaCart
long time, ‘variational ’ problems have been identified mostly with the ‘calculus of variations’. In that venerable subject, built around the minimization of integral functionals, constraints were relatively simple and much of the focus was on infinitedimensional function spaces. A major theme
Results 1  10
of
4,048