Results 1  10
of
629,227
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 110 (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 368 (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
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
2475–2479 This journal is © The Royal Society of Chemistry 2008 Pu bl ish ed o n M ar ch 8. D ow nl oa de d by P en ns yl va ni a St at e U ni ve rs ity o n /0
, 2008
"... First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are convenientl ..."
Abstract

Cited by 339 (7 self)
 Add to MetaCart
First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are conveniently formed, in DMF, by both direct and redoxcatalysed electroreduction of 1,2bis(halomethyl)arenes. Their predominant reaction is polymerisation to poly(oxylylene) (oPX) polymers. In the presence of dienophiles the electrogenerated oQDMs may undergo efficient cycloaddition reaction and distinctions between the possible mechanisms have been attempted on the basis of voltammetric, preparative and stereochemical experiments. Contrary to the precedent of the corresponding methyl ester, diphenyl maleate radicalanion isomerises only slowly to the fumarate radicalanion, yet coelectrolysis of 2,3bis(bromomethyl)1,4dimethoxybenzene and diphenyl maleate or diphenyl fumarate gives exclusively the corresponding transadduct. Coelectrolysis of dimethyl maleate with either 1,2bis(bromomethyl)benzene (more easily reduced) or 2,3bis(bromomethyl)1,4dimethoxybenzene (less easily reduced) gave only oPX polymer. The results are rationalised in terms of a double nucleophilic substitution mechanism where electron transfer between dienophile radicalanion and dihalide is relatively slow. Where electron transfer from maleate or fumarate radicalanions is likely to be fast oquinodimethanes are formed by redoxcatalysis and they polymerise rather than undergo Diels–Alder reaction. Dimerisation of the dienophile radicalanions, with k2 = 104 to 105 M1 s1, does not apparently compete with nucleophilic substitution or, where relevant, electron transfer.
CONSTRAINT NONDEGENERACY, STRONG REGULARITY AND NONSINGULARITY IN SEMIDEFINITE PROGRAMMING
"... 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, the stro ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
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
Results 1  10
of
629,227