A short proof on the cardinality of maximal positive bases

DOI10.1007/S11590-010-0229-3MaRDI QIDQ628667zbMATHOpenAlexFDO

Authors Charles Audet

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

zbMATH Keywords

direct searchpositive basisbasic feasible solutions

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On the cardinality of positively linearly independent sets
• Positive bases in numerical optimization
• scientific article; zbMATH DE number 4196163
• scientific article; zbMATH DE number 4034539
• scientific article; zbMATH DE number 4196162

Cites work

• scientific article; zbMATH DE number 3121295 (Why is no real title available?)
• Diagrams for Positive Bases
• Introduction to Derivative-Free Optimization
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• New algorithm for the conical combination representation problem of a vector
• Pattern Search Algorithms for Bound Constrained Minimization
• Positive bases in numerical optimization
• Theory of Positive Linear Dependence

Cited in

(9)

• Uniform simplex of an arbitrary orientation
• Nicely structured positive bases with maximal cosine measure
• On the cardinality of positively linearly independent sets
• On the properties of the cosine measure and the uniform angle subspace
• 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
• On the properties of positive spanning sets and positive bases
• Positive bases with maximal cosine measure
• Positive bases in numerical optimization

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)