—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...
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...
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...
S. Sundhar Ram, Angelia Nedic, Venugopal V. Veerav...
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...
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. ...