Pages that link to "Item:Q3127327"

The following pages link to On generalized bisection of 𝑛-simplices (Q3127327):

Displaying 18 items.

• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• An improved algorithm to test copositivity (Q427387) (← links)
• Pareto optimality and robustness in bi-blending problems (Q458955) (← links)
• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686) (← links)
• P-algorithm based on a simplicial statistical model of multimodal functions (Q621736) (← links)
• Longest-edge \(n\)-section algorithms: properties and open problems (Q747921) (← links)
• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234) (← links)
• The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
• Bisecton by global optimization revisited (Q965055) (← links)
• Copositive Lyapunov functions for switched systems over cones (Q1015029) (← links)
• LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D (Q1862200) (← links)
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
• On global and local mesh refinements by a generalized conforming bisection algorithm (Q1959467) (← links)
• Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
• Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
• On the exhaustivity of simplicial partitioning (Q2442641) (← links)
• Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)