Positive Bases for Linear Spaces
From MaRDI portal
Cites work
Cited in
(19)- On the existence and synthesis of multifinger positive grips
- Finitely positively independent sets
- Intersections of spherically convex sets
- On a class of convex polytopes
- On stochastic programming. I: Static linear programming under risk
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set
- On the properties of positive spanning sets and positive bases
- The generation of convex hulls
- Über die Durchschnitte translationsgleicher konvexer Körper und eine Klasse konvexer Polyeder
- Towards an algebraic characterization of convex polyhedral cones
- Interior points of convex hulls
- Zur Charakterisierung konvexer Körper. Über einen Satz von Rogers und Shephard. II
- The metric projections onto closed convex cones in a Hilbert space
- Derivative-free optimization methods
- Intersection Theorems for Positive Sets
- Polytopes, graphs, and complexes
- Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees
- Nicely structured positive bases with maximal cosine measure
- A characterization of positive spanning sets with ties to strongly edge-connected digraphs
This page was built for publication: Positive Bases for Linear Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5724164)