Quadratic-programming criteria for copositive matrices
DOI10.1016/0024-3795(89)90076-1zbMATH Open0681.15012OpenAlexW2053882461WikidataQ114852094 ScholiaQ114852094MaRDI QIDQ1823293FDOQ1823293
Authors: Hannu Väliaho 
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90076-1
Recommendations
linear programmingquadratic programmingalgorithmcopositive matricesNP-complete problemsimplex methodcopositive-plus
Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Determination of the inertia of a partitioned Hermitian matrix
- Some NP-complete problems in quadratic and nonlinear programming
- Criteria for copositive matrices
- Almost copositive matrices
- Testing the definiteness of matrices on polyhedral cones
- Least-index resolution of degeneracy in quadratic programming
- The general quadratic optimization problem
- Title not available (Why is that?)
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
- Title not available (Why is that?)
Cited In (22)
- The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems
- Algorithms for determining the copositivity of a given symmetric matrix
- Foundations of set-semidefinite optimization
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Quadratic factorization heuristics for copositive programming
- A copositivity probe
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Block pivoting and shortcut strategies for detecting copositivity
- Copositive matrices, copositive programming, and applications
- Testing copositivity with the help of difference-of-convex optimization
- Title not available (Why is that?)
- The copositive completion problem
- Criteria for copositive matrices
- An algorithm for determining copositive matrices
- Determining subspaces on which a matrix is nonnegative definite
- Copositivity aspects of standard quadratic optimization problems
- Copositive realxation for genera quadratic programming
- Copositivity and sparsity relations using spectral properties
- Sparse solutions to random standard quadratic optimization problems
- Copositivity tests based on the linear complementarity problem
- Algorithmic copositivity detection by simplicial partition
This page was built for publication: Quadratic-programming criteria for copositive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823293)
