Pages that link to "Item:Q5833227"

The following pages link to Theory of Positive Linear Dependence (Q5833227):

Displaying 50 items.

• On the cardinality of positively linearly independent sets (Q276303) (← links)
• Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework (Q386480) (← links)
• Pattern search methods framework for beam angle optimization in radiotherapy design (Q482433) (← links)
• Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
• A short proof on the cardinality of maximal positive bases (Q628667) (← links)
• Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
• An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
• Triple multiplicities for \(s\ell (r+1)\) and the spectrum of the exterior algebra of the adjoint representation (Q686007) (← links)
• A convergent variant of the Nelder--Mead algorithm (Q700697) (← links)
• Gale diagrams of convex polytopes and positive spanning sets of vectors (Q797150) (← links)
• Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull (Q814963) (← links)
• Grid restrained Nelder-Mead algorithm (Q853559) (← links)
• A quasi-Newton based pattern search algorithm for unconstrained optimization (Q864827) (← links)
• Grid-based methods for linearly equality constrained optimization problems (Q874345) (← links)
• A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization (Q931755) (← links)
• Unconstrained derivative-free optimization by successive approximation (Q953370) (← links)
• Blind channel equalization using constrained generalized pattern search optimization and reinitialization strategy (Q966882) (← links)
• A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) (← links)
• Mesh adaptive direct search algorithms for mixed variable optimization (Q1001325) (← links)
• Regularity conditions in differentiable vector optimization revisited (Q1035923) (← links)
• Pattern search ranking and selection algorithms for mixed variable simulation-based optimization (Q1042073) (← links)
• On the existence and synthesis of multifinger positive grips (Q1107337) (← links)
• Combinatorial properties of positive bases (Q1107829) (← links)
• Oriented matroids (Q1225060) (← links)
• On stochastic programming. I: Static linear programming under risk (Q1233816) (← links)
• A survey of Chandler Davis (Q1336391) (← links)
• Frame-based ray search algorithms in unconstrained optimization (Q1411465) (← links)
• Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method (Q1653583) (← links)
• Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints (Q1724802) (← links)
• A class of globally solvable Markovian quadratic BSDE systems and applications (Q1747757) (← links)
• MultiGLODS: global and local multiobjective optimization using direct search (Q1756778) (← links)
• Extended global convergence framework for unconstrained optimization (Q1882487) (← links)
• On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
• On the properties of the cosine measure and the uniform angle subspace (Q2028479) (← links)
• A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
• The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
• A deterministic algorithm to compute the cosine measure of a finite positive spanning set (Q2192976) (← links)
• Uniform simplex of an arbitrary orientation (Q2192988) (← links)
• Tilings of convex polyhedral cones and topological properties of self-affine tiles (Q2230911) (← links)
• Radicals of principal ideals and the class group of a Dedekind domain (Q2237256) (← links)
• Positive bases with maximal cosine measure (Q2329658) (← links)
• GLODS: global and local optimization using direct search (Q2350072) (← links)
• On the properties of positive spanning sets and positive bases (Q2357977) (← links)
• Efficient calculation of regular simplex gradients (Q2419521) (← links)
• A particle swarm pattern search method for bound constrained global optimization (Q2454725) (← links)
• A generating set search method using curvature information (Q2457951) (← links)
• Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm (Q2518730) (← links)
• The generation of convex hulls (Q2522037) (← links)
• Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces (Q2522488) (← links)