A short proof on the cardinality of maximal positive bases
From MaRDI portal
Publication:628667
DOI10.1007/S11590-010-0229-3zbMATH Open1211.90190OpenAlexW2067496524MaRDI QIDQ628667FDOQ628667
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
Recommendations
Cites Work
- Pattern Search Algorithms for Bound Constrained Minimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Introduction to Derivative-Free Optimization
- Diagrams for Positive Bases
- Theory of Positive Linear Dependence
- Positive bases in numerical optimization
- Title not available (Why is that?)
- New algorithm for the conical combination representation problem of a vector
Cited In (9)
- On the cardinality of positively linearly independent sets
- Positive bases in numerical optimization
- On the properties of the cosine measure and the uniform angle subspace
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set
- Uniform simplex of an arbitrary orientation
- Positive bases with maximal cosine measure
- On the properties of positive spanning sets and positive bases
- Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees
- Nicely structured positive bases with maximal cosine measure
This page was built for publication: A short proof on the cardinality of maximal positive bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628667)
