Algorithmic copositivity detection by simplicial partition
From MaRDI portal
Publication:2477530
DOI10.1016/J.LAA.2007.09.035zbMath1138.15007OpenAlexW1975881242MaRDI QIDQ2477530
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
Positive matrices and their generalizations; cones of matrices (15B48) Quadratic and bilinear forms, inner products (15A63)
Related Items (40)
On equivalent representations and properties of faces of the cone of copositive matrices ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ On monotonicity and search strategies in face-based copositivity detection algorithms ⋮ LP-based tractable subcones of the semidefinite plus nonnegative cone ⋮ Testing copositivity with the help of difference-of-convex optimization ⋮ On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Copositivity detection of tensors: theory and algorithm ⋮ Lyapunov stability for piecewise affine systems via cone-copositivity ⋮ A new certificate for copositivity ⋮ Copositivity and constrained fractional quadratic problems ⋮ P-algorithm based on a simplicial statistical model of multimodal functions ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ Performance comparison of two recently proposed copositivity tests ⋮ Separation and relaxation for cones of quadratic forms ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An improved algorithm to test copositivity ⋮ An algorithm for determining copositive matrices ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ On the exhaustivity of simplicial partitioning ⋮ Testing copositivity via mixed-integer linear programming ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Completely positive and copositive program modelling for quadratic optimization problems ⋮ Copositivity and sparsity relations using spectral properties ⋮ Copositive tensor detection and its applications in physics and hypergraphs ⋮ Quadratic factorization heuristics for copositive programming ⋮ A novel approach to stability analysis for switched positive linear systems ⋮ A simplex algorithm for rational cp-factorization ⋮ Foundations of Set-Semidefinite Optimization ⋮ Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ Copositivity tests based on the linear complementarity problem ⋮ Optimality conditions for linear copositive programming problems with isolated immobile indices ⋮ On copositiveness identification of partially symmetric rectangular tensors ⋮ Copositive Lyapunov functions for switched systems over cones ⋮ A modified simplex partition algorithm to test copositivity ⋮ Depth-first simplicial partition for copositivity detection, with an application to MaxClique ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Criteria for copositive matrices
- Testing the definiteness of matrices on polyhedral cones
- Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints
- Finite criteria for conditional definiteness of quadratic forms
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Conditionally definite matrices
- A test for copositive matrices
- Quadratic-programming criteria for copositive matrices
- On copositive matrices
- Criteria for copositive matrices using simplices and barycentric coordinates
- On classes of copositive matrices
- Block pivoting and shortcut strategies for detecting copositivity
- Arbitrarily weak linear convexity conditions formultivariate poynomials
- Approximation of the Stability Number of a Graph via Copositive Programming
- On generalized bisection of 𝑛-simplices
- Some NP-complete problems in quadratic and nonlinear programming
- Copositive realxation for genera quadratic programming
- Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality
- Bimatrix Equilibrium Points and Mathematical Programming
- On copositive programming and standard quadratic optimization problems
- A copositivity probe
This page was built for publication: Algorithmic copositivity detection by simplicial partition