697 search results - page 29 / 140 » Convex Functions on Discrete Sets |
172
click to vote
WCE
2007
15 years 7 months ago
2007
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
169
Voted
MP
2011
14 years 9 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
157
click to vote
JOTA
2010
15 years 5 months ago
2010
We consider a distributed multi-agent network system where the goal is to minimize a sum of agent objective functions subject to a common set of constraints. For this problem, we p...
164
click to vote
SIAMCO
2010
15 years 1 months ago
2010
A minimum time problem with a nonlinear smooth dynamics and a target satisfying an internal sphere condition is considered. Under the assumption that the minimum time T be continu...
171
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...