A short proof on the cardinality of maximal positive bases

Optimization Letters

Volumn 5, Issue 1, 2011, Pages 191-194

  Audet, Charles ^a  

^a GERAD   (Canada)

Author keywords

Basic feasible solutions; Direct search; Positive basis

Indexed keywords

LINEAR PROGRAMMING;

CARDINALITIES; DIRECT SEARCH; DIRECT SEARCH OPTIMIZATION; FEASIBLE SOLUTION; FUNDAMENTAL PROPERTIES; LINEAR COMBINATIONS; NON NEGATIVES; POSITIVE BASIS;

VECTOR SPACES;

EID: 78650731003     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-010-0229-3     Document Type: Article

References (8)

1. Audet C., Dennis J. E. Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188-217 (2006).
2. Conn A. R., Scheinberg K., Vicente L. N.: Introduction to Derivative-Free Optimization. MPS/SIAM Book Series on Optimization. SIAM, Philadelphia (2009).
3. Coope I. D., Price C. J.: Positive bases in numerical optimization. Comput. Optim. Appl. 21(2), 169-175 (2002).
4. Davis C.: Theory of positive linear dependence. Am. J. Math. 76, 733-746 (1954).
5. Gale D.: Neighboring vertices on a convex polyhedron. In: Kuhn, H. W, Tucker, A. W. (eds) Linear inequalities and related systems. Annals of Mathematics Studies, vol. 38, pp. 255-263. Princeton University Press, Princeton (1956).
6. Huang H. X., Pardalos P. M.: New algorithm for the conical combination representation problem of a vector. J. Optim. Theory Appl. 109(3), 495-519 (2001).
7. Lewis R. M., Torczon V.: Rank ordering and positive bases in pattern search algorithms. Technical Report TR96-71, ICASE, NASA Langley Research Center (1999).
8. Shephard G. C.: Diagrams for positive bases. J. Lond. Math. Soc. s2-4(1), 165-175 (1971).