Theory of Positive Linear Dependence
From MaRDI portal
Publication:5833227
DOI10.2307/2372648zbMath0058.25201OpenAlexW2312715465WikidataQ108906005 ScholiaQ108906005MaRDI QIDQ5833227
Publication date: 1954
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2372648
Related Items
On the properties of positive spanning sets and positive bases, On the cardinality of positively linearly independent sets, Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions, Simplicial faces and sections of a convex polytope, On minimal positive basis for polyhedral cones in Rn, A survey of Chandler Davis, Extended global convergence framework for unconstrained optimization, Using first-order information in direct multisearch for multiobjective optimization, Grid restrained Nelder-Mead algorithm, On the existence and synthesis of multifinger positive grips, Combinatorial properties of positive bases, Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method, Quantifying uncertainty with ensembles of surrogates for blackbox optimization, A quasi-Newton based pattern search algorithm for unconstrained optimization, Polytopes, graphs, and complexes, Continuity of Some Convex-Cone-Valued Mappings, Grid-based methods for linearly equality constrained optimization problems, Constraint qualifications in nonsmooth optimization: Classification and inter-relations, Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework, THE METRIC PROJECTIONS ONTO CLOSED CONVEX CONES IN A HILBERT SPACE, Efficient calculation of regular simplex gradients, Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems, Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees, Intersection Theorems for Positive Sets, A deterministic algorithm to compute the cosine measure of a finite positive spanning set, Uniform simplex of an arbitrary orientation, CECM: a continuous empirical cubature method with application to the dimensional hyperreduction of parameterized finite element models, A short proof on the cardinality of maximal positive bases, Nicely structured positive bases with maximal cosine measure, Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints, Frame-based ray search algorithms in unconstrained optimization, A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION, Parallel strategies for direct multisearch, Unnamed Item, Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions, Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints, A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization, A particle swarm pattern search method for bound constrained global optimization, An algorithm to find the lineality space of the positive hull of a set of vectors, Pattern search methods framework for beam angle optimization in radiotherapy design, A generating set search method using curvature information, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, Tilings of convex polyhedral cones and topological properties of self-affine tiles, Inexact restoration method for nonlinear optimization without derivatives, Radicals of principal ideals and the class group of a Dedekind domain, A class of globally solvable Markovian quadratic BSDE systems and applications, Unconstrained derivative-free optimization by successive approximation, Triple multiplicities for \(s\ell (r+1)\) and the spectrum of the exterior algebra of the adjoint representation, Frame based methods for unconstrained optimization, MultiGLODS: global and local multiobjective optimization using direct search, Blind channel equalization using constrained generalized pattern search optimization and reinitialization strategy, A convergent variant of the Nelder--Mead algorithm, Partitions of points into simplices with \(k\)-dimensional intersection. II: Proof of Reay's conjecture in dimensions 4 and 5, A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization, Oriented matroids, Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization, On the use of polynomial models in multiobjective directional direct search, On stochastic programming. I: Static linear programming under risk, On the properties of the cosine measure and the uniform angle subspace, \(\mathbb{Z}\)-linear Gale duality and poly weighted spaces (PWS), The method of normal local stabilization, Mesh adaptive direct search algorithms for mixed variable optimization, On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods, Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm, A second-order globally convergent direct-search method and its worst-case complexity, The generation of convex hulls, Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces, Positive Bases for Linear Spaces, A comparison of primal and dual methods of linear programming, Über die Durchschnitte translationsgleicher konvexer Körper und eine Klasse konvexer Polyeder, Towards an algebraic characterization of convex polyhedral cones, Interior points of convex hulls, Multi-objective memetic algorithm: comparing artificial neural networks and pattern search filter method approaches, Zur Charakterisierung konvexer Körper. Über einen Satz von Rogers und Shephard. II, Linear Positive Systems May Have a Reachable Subset from the Origin That is Either Polyhedral or Nonpolyhedral, Exploiting problem structure in pattern search methods for unconstrained optimization, A modified Nelder-Mead barrier method for constrained optimization, Derivative-free optimization methods, Regularity conditions in differentiable vector optimization revisited, Pattern search ranking and selection algorithms for mixed variable simulation-based optimization, Positive bases with maximal cosine measure, The regularized feasible directions method for nonconvex optimization, Direct Search Based on Probabilistic Descent, Gale diagrams of convex polytopes and positive spanning sets of vectors, On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization, GLODS: global and local optimization using direct search, Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
