Algorithmic copositivity detection by simplicial partition

From MaRDI portal
Revision as of 01:28, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2477530

DOI10.1016/J.LAA.2007.09.035zbMath1138.15007OpenAlexW1975881242MaRDI QIDQ2477530

Mirjam Dür, Stefan Bundfuss

Publication date: 14 March 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2007.09.035




Related Items (40)

On equivalent representations and properties of faces of the cone of copositive matricesOn conic QPCCs, conic QCQPs and completely positive programsOn monotonicity and search strategies in face-based copositivity detection algorithmsLP-based tractable subcones of the semidefinite plus nonnegative coneTesting copositivity with the help of difference-of-convex optimizationOn the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible setsAn Analytic Center Cutting Plane Method to Determine Complete Positivity of a MatrixCopositivity detection of tensors: theory and algorithmLyapunov stability for piecewise affine systems via cone-copositivityA new certificate for copositivityCopositivity and constrained fractional quadratic problemsP-algorithm based on a simplicial statistical model of multimodal functionsOptimization under uncertainty and risk: quadratic and copositive approachesPerformance comparison of two recently proposed copositivity testsSeparation and relaxation for cones of quadratic formsCopositive optimization -- recent developments and applicationsThink co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimizationAn improved algorithm to test copositivityAn algorithm for determining copositive matricesCopositivity detection by difference-of-convex decomposition and \(\omega \)-subdivisionOn the exhaustivity of simplicial partitioningTesting copositivity via mixed-integer linear programmingCopositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017Completely positive and copositive program modelling for quadratic optimization problemsCopositivity and sparsity relations using spectral propertiesCopositive tensor detection and its applications in physics and hypergraphsQuadratic factorization heuristics for copositive programmingA novel approach to stability analysis for switched positive linear systemsA simplex algorithm for rational cp-factorizationFoundations of Set-Semidefinite OptimizationExtended trust-region problems with one or two balls: exact copositive and Lagrangian relaxationsA Complete Semidefinite Algorithm for Detecting Copositive Matrices and TensorsCopositivity tests based on the linear complementarity problemOptimality conditions for linear copositive programming problems with isolated immobile indicesOn copositiveness identification of partially symmetric rectangular tensorsCopositive Lyapunov functions for switched systems over conesA modified simplex partition algorithm to test copositivityDepth-first simplicial partition for copositivity detection, with an application to MaxCliqueCopositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization ProblemsDetecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme




Cites Work




This page was built for publication: Algorithmic copositivity detection by simplicial partition