On the cardinality of positively linearly independent sets

DOI10.1007/S11590-015-0959-3MaRDI QIDQ276303zbMATH OpenOpenAlexFDO

Authors Warren L. Hare, H. Song

Publication date 3 May 2016

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.07496

zbMATH Keywords

convex analysispositive basispositive linear independence

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56)

Abstract: Positive bases, which play a key role in understanding derivative free optimization methods that use a direct search framework, are positive spanning sets that are positively linearly independent. The cardinality of a positive basis in $R^n$ has been established to be between $n+1$ and $2n$ (with both extremes existing). The lower bound is immediate from being a positive spanning set, while the upper bound uses {em both} positive spanning and positively linearly independent. In this note, we provide details proving that a positively linearly independent set in $R^n$ for $nin1,2$ has at most $2n$ elements, but a positively linearly independent set in $R^n$ for $ngeq3$ can have an arbitrary number of elements.

Recommendations

• scientific article; zbMATH DE number 4027364
• On posets and independence spaces
• scientific article; zbMATH DE number 7211627
• The relationships between posets and independent sets of a matroid of arbitrary cardinality
• On the number of independent sets in uniform, regular, linear hypergraphs
• Linear independence and sets of uniqueness
• On cardinality bounds involving the weak Lindelöf degree
• Linear independence in finite spaces
• On linear spaces and matroids of arbitrary cardinality
• scientific article; zbMATH DE number 4075944

Cites work

• A short proof on the cardinality of maximal positive bases
• Diagrams for Positive Bases
• scientific article; zbMATH DE number 2002582 (Why is no real title available?)
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• On the properties of positive spanning sets and positive bases
• Positive bases in numerical optimization
• Theory of Positive Linear Dependence
• Variational Analysis

Cited in

(7)

• A deterministic algorithm to compute the cosine measure of a finite positive spanning set
• Positive bases with maximal cosine measure
• Positive Dependence, Upper Sets, and Multidimensional Partitions
• scientific article; zbMATH DE number 7211627 (Why is no real title available?)
• A short proof on the cardinality of maximal positive bases
• A construction of non-isomorphic polyhedral cones using Lyapunov rank
• The cosine measure relative to a subspace

This page was built for publication: On the cardinality of positively linearly independent sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276303)