A Note on the Paper "The Algebraic Structure of the Arbitrary-Order Cone"
Abstract
References
Recommendations
The Algebraic Structure of the Arbitrary-Order Cone
We study and analyze the algebraic structure of the arbitrary-order cones. We show that, unlike popularly perceived, the arbitrary-order cone is self-dual for any order greater than or equal to 1. We establish a spectral decomposition, consider the ...
An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
The convex feasibility problem in general is a problem of finding a point in a convex set that contains a full dimensional ball and is contained in a compact convex set. We assume that the outer set is described by second-order cone inequalities and ...
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones
Integer Programming and Combinatorial OptimizationAbstractWe investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a notion ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Plenum Press
United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in