A short proof on the cardinality of maximal positive bases
From MaRDI portal
Publication:628667
DOI10.1007/s11590-010-0229-3zbMath1211.90190OpenAlexW2067496524MaRDI QIDQ628667
Publication date: 14 March 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0229-3
Related Items (8)
On the properties of positive spanning sets and positive bases ⋮ On the cardinality of positively linearly independent sets ⋮ Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees ⋮ A deterministic algorithm to compute the cosine measure of a finite positive spanning set ⋮ Uniform simplex of an arbitrary orientation ⋮ Nicely structured positive bases with maximal cosine measure ⋮ On the properties of the cosine measure and the uniform angle subspace ⋮ Positive bases with maximal cosine measure
Cites Work
- Introduction to Derivative-Free Optimization
- Pattern Search Algorithms for Bound Constrained Minimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Diagrams for Positive Bases
- Theory of Positive Linear Dependence
- New algorithm for the conical combination representation problem of a vector
- Positive bases in numerical optimization
- Unnamed Item
This page was built for publication: A short proof on the cardinality of maximal positive bases
