Theory of Positive Linear Dependence

Cited in

(97)

Mesh adaptive direct search algorithms for mixed variable optimization
Regularity conditions in differentiable vector optimization revisited
Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
On the existence and synthesis of multifinger positive grips
Combinatorial properties of positive bases
Oriented matroids
On stochastic programming. I: Static linear programming under risk
A survey of Chandler Davis
Frame-based ray search algorithms in unconstrained optimization
Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method
Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints
A class of globally solvable Markovian quadratic BSDE systems and applications
MultiGLODS: global and local multiobjective optimization using direct search
Extended global convergence framework for unconstrained optimization
On the use of polynomial models in multiobjective directional direct search
On the properties of the cosine measure and the uniform angle subspace
A modified Nelder-Mead barrier method for constrained optimization
The regularized feasible directions method for nonconvex optimization
Quantifying uncertainty with ensembles of surrogates for blackbox optimization
A deterministic algorithm to compute the cosine measure of a finite positive spanning set
Uniform simplex of an arbitrary orientation
Tilings of convex polyhedral cones and topological properties of self-affine tiles
Radicals of principal ideals and the class group of a Dedekind domain
Positive bases with maximal cosine measure
GLODS: global and local optimization using direct search
On the properties of positive spanning sets and positive bases
Efficient calculation of regular simplex gradients
A particle swarm pattern search method for bound constrained global optimization
A generating set search method using curvature information
Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
The generation of convex hulls
Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces
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
Zur Charakterisierung konvexer Körper. Über einen Satz von Rogers und Shephard. II
Parallel strategies for direct multisearch
On the cardinality of positively linearly independent sets
A second-order globally convergent direct-search method and its worst-case complexity
On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
Multi-objective memetic algorithm: comparing artificial neural networks and pattern search filter method approaches
Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework
Simplicial faces and sections of a convex polytope
A direct search quasi-Newton method for nonsmooth unconstrained optimization
The mesh adaptive direct search algorithm for granular and discrete variables
Pattern search methods framework for beam angle optimization in radiotherapy design
Inexact restoration method for nonlinear optimization without derivatives
Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions
Using first-order information in direct multisearch for multiobjective optimization
Constraint qualifications in nonsmooth optimization: Classification and inter-relations
The metric projections onto closed convex cones in a Hilbert space
The method of normal local stabilization
On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
Linear positive systems may have a reachable subset from the origin that is either polyhedral or nonpolyhedral
Derivative-free optimization methods
Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
Exploiting problem structure in pattern search methods for unconstrained optimization
Direct search based on probabilistic descent
Continuity of Some Convex-Cone-Valued Mappings
Intersection Theorems for Positive Sets
Polytopes, graphs, and complexes
Positive Bases for Linear Spaces
On minimal positive basis for polyhedral cones in Rn
Frame based methods for unconstrained optimization
Partitions of points into simplices with k-dimensional intersection. II: Proof of Reay's conjecture in dimensions 4 and 5
\(\mathbb{Z}\)-linear Gale duality and poly weighted spaces (PWS)
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
CECM: a continuous empirical cubature method with application to the dimensional hyperreduction of parameterized finite element models
Nicely structured positive bases with maximal cosine measure
Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
Continuity of the conic hull
A short proof on the cardinality of maximal positive bases
Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
An algorithm to find the lineality space of the positive hull of a set of vectors
A hybrid direct search and projected simplex gradient method for convex constrained minimization
Triple multiplicities for \(s\ell (r+1)\) and the spectrum of the exterior algebra of the adjoint representation
Colorful positive bases decomposition and Helly-type results for cones
Model-and-search: a derivative-free local optimization algorithm
Dynamical sampling for unmanned aerial vehicles
A construction of non-isomorphic polyhedral cones using Lyapunov rank
Continuous safety-critical control of Euler-Lagrange systems subject to multiple obstacles and velocity constraints
The cosine measure relative to a subspace
A characterization of positive spanning sets with ties to strongly edge-connected digraphs
A convergent variant of the Nelder--Mead algorithm
On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy
Gamma invariance and Dirichlet proportion for random exchange processes on graphs
Gale diagrams of convex polytopes and positive spanning sets of vectors
Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull
Grid restrained Nelder-Mead algorithm
A quasi-Newton based pattern search algorithm for unconstrained optimization
Grid-based methods for linearly equality constrained optimization problems
A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
Unconstrained derivative-free optimization by successive approximation
Blind channel equalization using constrained generalized pattern search optimization and reinitialization strategy
A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization

This page was built for publication: Theory of Positive Linear Dependence

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