-
作者：Rubinov, AM; Huang, XX; Yang, XQ
作者单位：Hong Kong Polytechnic University
摘要：We examine the validity of the zero duality gap properties for two important dual schemes: a generalized augmented Lagrangian dual scheme and a nonlinear Lagrange-type dual scheme. The necessary and sufficient conditions for the zero duality gap property to hold are established in terms of the lower semicontinuity of the perturbation functions.
-
作者：Cánovas, MJ; López, MA; Parra, J
作者单位：Universidad Miguel Hernandez de Elche; Universitat d'Alacant
摘要：In this paper, we consider a parametric family of convex inequality systems in the Euclidean space, with an arbitrary infinite index set, T, and convex constraints depending continuously on a parameter ranging in a separable metric space. No structure is assumed for T, and so the dependence of the constraints on the index has no particular property. In this context, the possibility of approaching the nominal system by means of sequences of finite subsystems associated to proximal parameters is...
-
作者：Guenin, B
作者单位：University of Waterloo
摘要：A family of sets H is ideal if the polyhedron {x greater than or equal to 0:Sigma(iis an element ofS) x(i).greater than or equal to 1, For All S is an element of H} is integral. Consider a graph G with vertices s, t. An odd st-walk is either an odd st-path or the union of an even st-path and an odd circuit that share, at most, one vertex. Let T be a subset of vertices of even cardinality. An st-T-cut is a cut of the form delta(U) where \U boolean AND T\ is odd and U contains exactly one of s o...
-
作者：Granot, D; Kuipers, J; Chopra, S
作者单位：University of British Columbia; Maastricht University; Northwestern University; Northwestern University
摘要：We analyze a cost allocation problem which could naturally arise from a situation wherein a tree network T = (N boolean OR {0}, E), serving heterogeneous customers, has to be constructed. The customers, located at N, require some service from a central supplier, located at vertex 0. The customers have heterogeneous preferences for the level or quality of service received from the central supplier. We formulate the above cost allocation problem as a cooperative game, referred to as an extended ...
-
作者：Bernstein, DS; Givan, R; Immerman, N; Zilberstein, S
作者单位：University of Massachusetts System; University of Massachusetts Amherst; Purdue University System; Purdue University
摘要：We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalizations of both the fully observable case and the partially observable case that allow for decentralized control are described. For even two agents, the finite-horizon problems corresponding to both of these models are hard for nondeterministic exponential time. These complexity results illustrate a fundamental difference b...
-
作者：Dan, H; Yamashita, N; Fukushima, M
作者单位：Kyoto University
摘要：The purpose of this paper,is to present an algorithm for solving the monotone nonlinear complementarity problem (NCP) that enjoys superlinear convergence in a genuine sense without the uniqueness and nondegeneracy conditions. Recently, Yamashita and Fukushima (2001) proposed a method based on the proximal point algorithm (PPA) for monotone NCP. The method has the favorable property that a generated sequence converges to the solution set of NCP superlinearly. However, when a generated sequence ...
