Results 21  30
of
1,894
Applications of Secondorder Cone Programming
, 1998
"... In a secondorder cone program (SOCP) a linear function is minimized over the intersection of an affine set and the product of secondorder (quadratic) cones. SOCPs are nonlinear convex problems that include linear and (convex) quadratic programs as special cases, but are less general than semidefin ..."
Abstract

Cited by 216 (10 self)
 Add to MetaCart
In a secondorder cone program (SOCP) a linear function is minimized over the intersection of an affine set and the product of secondorder (quadratic) cones. SOCPs are nonlinear convex problems that include linear and (convex) quadratic programs as special cases, but are less general than
Polyhedral cone invariance applied to rendezvous of multiple agents.
 Proceedings of the 43rd IEEE Conference on Decision and Control,
, 2004
"... AbstractIn this paper, we pose the N scalar agent rendezvous as a polyhedral cone invariance problem in the N dimensional phase space. The underlying dynamics of the agents are assumed to be linear. We derive a condition for positive invariance for polyhedral cones. Based on this condition, we de ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
AbstractIn this paper, we pose the N scalar agent rendezvous as a polyhedral cone invariance problem in the N dimensional phase space. The underlying dynamics of the agents are assumed to be linear. We derive a condition for positive invariance for polyhedral cones. Based on this condition, we
Fast grasp planning for hand/arm systems based on convex model
 IEEE International Conference on Robotics and Automation
, 2008
"... Abstract—This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the friction cone, our proposed algorithm can calculate the grasping motion within the reasonable time. For each grasping styl ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
. To determine the contact point position satisfying the force closure, we use two approximation models of the friction cone. To save the calculation time, the rough approximation by using the ellipsoid is mainly used to check the force closure. Additionally, approximation by using the convex polyhedral cone
Clustering appearances of objects under varying illumination conditions
 In CVPR
, 2003
"... We introduce two appearancebased methods for clustering a set of images of 3D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to individual objects. The first algorithm is based on the concept of illumination cones. According to the theory, the clusteri ..."
Abstract

Cited by 117 (3 self)
 Add to MetaCart
, the clustering problem is equivalent to finding convex polyhedral cones in the highdimensional image space. To efficiently determine the conic structures hidden in the image data, we introduce the concept of conic affinity which measures the likelihood of a pair of images belonging to the same underlying
Lifts of convex sets and cone factorizations
 Mathematics of OR
"... Abstract. In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or “lift ” of the convex set is especially useful if the cone admits an efficient algorithm for linear op ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
between polyhedral lifts of a polytope and nonnegative factorizations of its slack matrix. Symmetric lifts of convex sets can also be characterized similarly. When the cones live in a family, our results lead to the definition of the rank of a convex set with respect to this family. We present results
GAUSS IMAGES OF HYPERBOLIC CUSPS WITH CONVEX POLYHEDRAL BOUNDARY
, 2009
"... We prove that a 3–dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed contractible geodesics of length greater than 2π is the metric of the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We prove that a 3–dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed contractible geodesics of length greater than 2π is the metric
Combining Pathway Analysis with Flux Balance Analysis for the Comprehensive Study of Metabolic Systems. Biotechnology and Bioengineering
"... Abstract: The elucidation of organismscale metabolic networks necessitates the development of integrative methods to analyze and interpret the systemic properties of cellular metabolism. A shift in emphasis from single metabolic reactions to systemically defined pathways is one consequence of such ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
polyhedral cone in a highdimensional space. From metabolic pathway analysis, the edges of the highdimensional flux cone are vectors that correspond to systemically defined “extreme pathways ” spanning the ca
Projection of polyhedral cones and linear vector optimization
, 2014
"... Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We define a cone projection problem using the data of a given lin ..."
Abstract
 Add to MetaCart
Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We define a cone projection problem using the data of a given
CONES OF CLOSED ALTERNATING WALKS AND TRAILS
"... Dedicated to the memory of Malka Peled Abstract. Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges. The set of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of all such assignments forms a convex polyhedral cone in the edge space, called the alternating cone. The integral (respectively, {0, 1}) vectors in the alternating cone are sums of characteristic vectors of closed alternating walks (respectively, trails). We study the basic properties
Polyhedrally Tight Set Functions and Discrete Convexity
, 2005
"... This paper studies the class of polyhedrally tight functions in terms of the basic theorems on convex functions over ℜ n, such as the Fenchel Duality Theorem, Separation Theorem etc. (Polyhedrally tight functions are those for which the inequalities y T x ≤ f(y), y ∈ A in x ∈ A ∗ with A, A ∗ ⊆ ℜ n ..."
Abstract
 Add to MetaCart
This paper studies the class of polyhedrally tight functions in terms of the basic theorems on convex functions over ℜ n, such as the Fenchel Duality Theorem, Separation Theorem etc. (Polyhedrally tight functions are those for which the inequalities y T x ≤ f(y), y ∈ A in x ∈ A ∗ with A, A ∗ ⊆ ℜ n
Results 21  30
of
1,894