Results 1  10
of
608,548
Complementarity and Nondegeneracy in Semidefinite Programming
, 1995
"... Primal and dual nondegeneracy conditions are defined for semidefinite programming. Given the existence of primal and dual solutions, it is shown that primal nondegeneracy implies a unique dual solution and that dual nondegeneracy implies a unique primal solution. The converses hold if strict complem ..."
Abstract

Cited by 111 (9 self)
 Add to MetaCart
Primal and dual nondegeneracy conditions are defined for semidefinite programming. Given the existence of primal and dual solutions, it is shown that primal nondegeneracy implies a unique dual solution and that dual nondegeneracy implies a unique primal solution. The converses hold if strict
Nondegeneracy of Polyhedra and Linear Programs
, 1995
"... This paper deals with nondegeneracy of polyhedra and linear programming (LP) problems. We allow for the possibility that the polyhedra and the feasible polyhedra of the LP problems under consideration be nonpointed. (A polyhedron is pointed if it has a vertex.) With respect to a given polyhedron, w ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
this terminology since the term dual nondegeneracy is already used to refer to a related but different type of nondegeneracy.) We show two main results about constant cost nondegeneracy of an LP problem. The first one shows that constant cost nondegeneracy of an LP problem is equivalent to the condition
ADDENDA AND ERRATA FOR ON NONDEGENERACY OF CURVES
"... This note gives some addenda and errata for the article On nondegeneracy of curves [3]. ..."
Abstract
 Add to MetaCart
This note gives some addenda and errata for the article On nondegeneracy of curves [3].
EventtoSink Reliable Transport in Wireless Sensor Networks
 IEEE/ACM Trans. Networking
, 2005
"... Abstract—Wireless sensor networks (WSNs) are eventbased systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional endtoend reliab ..."
Abstract

Cited by 378 (11 self)
 Add to MetaCart
with minimum energy expenditure. It includes a congestion control component that serves the dual purpose of achieving reliability and conserving energy. Importantly, the algorithms of ESRT mainly run on the sink, with minimal functionality required at resource constrained sensor nodes. ESRT protocol operation
Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming
 SIAM Journal on optimization
, 2009
"... Abstract It is known that the KarushKuhnTucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric and positive semidefinite matrices. We show in this paper that the primal and dual constraint nondegeneracies, ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
Abstract It is known that the KarushKuhnTucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric and positive semidefinite matrices. We show in this paper that the primal and dual constraint nondegeneracies
Nondegeneracy of the Lie algebra aff(n)
, 2002
"... We show that aff(n), the Lie algebra of affine transformations of R n, is analytically nondegenerate in the sense of A. Weinstein; this means that every analytic Poisson structure vanishing at a point with a linear part corresponding to aff(n) is locally analytically linearizable. ..."
Abstract
 Add to MetaCart
We show that aff(n), the Lie algebra of affine transformations of R n, is analytically nondegenerate in the sense of A. Weinstein; this means that every analytic Poisson structure vanishing at a point with a linear part corresponding to aff(n) is locally analytically linearizable.
On nondegeneracy of curves
 Algebra & Number Theory
, 2009
"... Abstract. We study the conditions under which an algebraic curve can be modelled by a Laurent polynomial that is nondegenerate with respect to its Newton polytope. We prove that every curve of genus g ≤ 4 over an algebraically closed field is nondegenerate in the above sense. More generally, let be ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
Abstract. We study the conditions under which an algebraic curve can be modelled by a Laurent polynomial that is nondegenerate with respect to its Newton polytope. We prove that every curve of genus g ≤ 4 over an algebraically closed field is nondegenerate in the above sense. More generally, let
Remarks On Nondegeneracy In Mixed SemidefiniteQuadratic Programming
, 1998
"... We consider the definitions of nondegeneracy and strict complementarity given in [5] for semidefinite programming (SDP) and their obvious extensions to mixed semidefinitequadratic programming (SDQP). We show that a solution to SDQP satisfies strict complementarity and primal and dual nondegeneracy ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider the definitions of nondegeneracy and strict complementarity given in [5] for semidefinite programming (SDP) and their obvious extensions to mixed semidefinitequadratic programming (SDQP). We show that a solution to SDQP satisfies strict complementarity and primal and dual
Renormalization group flows from holography  Supersymmetry and a ctheorem
 ADV THEOR. MATH. PHYS
, 1999
"... We obtain first order equations that determine a supersymmetric kink solution in fivedimensional N = 8 gauged supergravity. The kink interpolates between an exterior antide Sitter region with maximal supersymmetry and an interior antide Sitter region with one quarter of the maximal supersymmetry. ..."
Abstract

Cited by 294 (25 self)
 Add to MetaCart
between fields of bulk supergravity in the interior antide Sitter region and composite operators of the infrared field theory. We also point out that the truncation used to find the reduced symmetry critical point can be extended to obtain a new N = 4 gauged supergravity theory holographically dual to a
SecondOrder Cone Programming
 MATHEMATICAL PROGRAMMING
, 2001
"... In this paper we survey the second order cone programming problem (SOCP). First we present several applications of the problem in various areas of engineering and robust optimization problems. We also give examples of optimization problems that can be cast as SOCPs. Next we review an algebraic struc ..."
Abstract

Cited by 247 (11 self)
 Add to MetaCart
structure that is connected to SOCP. This algebra is a special case of a Euclidean Jordan algebra. After presenting duality theory, complementary slackness conditions, and definitions and algebraic characterizations of primal and dual nondegeneracy and strict complementarity we review the logarithmic
Results 1  10
of
608,548