Results 1  10
of
814
INEQUALITIES FOR DUAL AFFINE QUERMASSINTEGRALS
, 2005
"... For star bodies, the dual affine quermassintegrals were introduced and studied in several papers. The aim of this paper is to study them further. In this paper, some inequalities for dual affine quermassintegrals are established, such as the Minkowski inequality, the dual BrunnMinkowski inequality, ..."
Abstract
 Add to MetaCart
For star bodies, the dual affine quermassintegrals were introduced and studied in several papers. The aim of this paper is to study them further. In this paper, some inequalities for dual affine quermassintegrals are established, such as the Minkowski inequality, the dual BrunnMinkowski inequality
Dual Affine invariant points
, 2013
"... An affine invariant point on the class of convex bodies Kn in R n, endowed with the Hausdorff metric, is a continuous map from Kn to R n which is invariant under onetoone affine transformations A on R n, that is, p ` A(K) ´ = A ` p(K) ´. We define here the new notion of dual affine point q of a ..."
Abstract
 Add to MetaCart
An affine invariant point on the class of convex bodies Kn in R n, endowed with the Hausdorff metric, is a continuous map from Kn to R n which is invariant under onetoone affine transformations A on R n, that is, p ` A(K) ´ = A ` p(K) ´. We define here the new notion of dual affine point q
Dual affine quantum groups
 Math. Zeitschrift
"... Abstract. Let ˆg be an untwisted affine KacMoody algebra, with its SklyaninDrinfel’d structure of Lie bialgebra, and let ˆh be the dual Lie bialgebra. By dualizing the quantum double construction — via formal Hopf algebras — we construct a new quantum group Uq ˆh, dual of Uq(ˆg). Studying its spec ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Let ˆg be an untwisted affine KacMoody algebra, with its SklyaninDrinfel’d structure of Lie bialgebra, and let ˆh be the dual Lie bialgebra. By dualizing the quantum double construction — via formal Hopf algebras — we construct a new quantum group Uq ˆh, dual of Uq(ˆg). Studying its
Superlinear primaldual affine scaling algorithms for LCP
, 1993
"... We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown to ..."
Abstract
 Add to MetaCart
We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown
Superlinear PrimalDual Affine Scaling Algorithms for LCP
 Mathematics of Operations Research
, 1993
"... We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown to ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We describe an interiorpoint algorithm for monotone linear complementarity problems in which primaldual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Qorder up to (but not including) two. The technique is shown
Limit Analysis with the Dual Affine Scaling Algorithm
 J. Comput. Appl. Math
, 1995
"... The collapse state of a rigid plastic material with the linearized Mises yield condition is computed. We use an infeasible point variant of the dual affine scaling algorithm for linear programming which is extremely efficient for this large sparse and ill conditioned problem. For a classical test pr ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The collapse state of a rigid plastic material with the linearized Mises yield condition is computed. We use an infeasible point variant of the dual affine scaling algorithm for linear programming which is extremely efficient for this large sparse and ill conditioned problem. For a classical test
Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties
 J. Alg. Geom
, 1994
"... We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined
PrimalDual AffineScaling Algorithms Fail For Semidefinite Programming
, 1998
"... In this paper, we give an example of a semidefinite programming problem in which primaldual affinescaling algorithms using the HRVW/KSH/M, MT, and AHO directions fail. We prove that each of these algorithm can generate a sequence converging to a nonoptimal solution, and that, for the AHO directio ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper, we give an example of a semidefinite programming problem in which primaldual affinescaling algorithms using the HRVW/KSH/M, MT, and AHO directions fail. We prove that each of these algorithm can generate a sequence converging to a nonoptimal solution, and that, for the AHO
Polynomiality of PrimalDual Affine Scaling Algorithms for Nonlinear Complementarity Problems
, 1995
"... This paper provides an analysis of the polynomiality of primaldual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
to mappings that are not monotone. We show that a family of primaldual affine scaling algorithms generates an approximate solution (given a precision ffl) of the nonlinear complementarity problem in a finite number of iterations whose order is a polynomial of n, ln(1=ffl) and a condition number
Crystal Structure of A Plant DualAffinity Nitrate Transporter
"... Nitrate is a primary nutrient for plant growth, but its levels in soil can fluctuate by several orders of magnitude. Previous studies have identified Arabidopsis NRT1.1 as a dualaffinity nitrate transporter, which can take up nitrate over a wide range of concentrations. The mode of action of NRT1.1 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Nitrate is a primary nutrient for plant growth, but its levels in soil can fluctuate by several orders of magnitude. Previous studies have identified Arabidopsis NRT1.1 as a dualaffinity nitrate transporter, which can take up nitrate over a wide range of concentrations. The mode of action of NRT1
Results 1  10
of
814