Quadratic-programming criteria for copositive matrices

DOI10.1016/0024-3795(89)90076-1MaRDI QIDQ1823293zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

linear programmingquadratic programmingalgorithmcopositive matricesNP-complete problemsimplex methodcopositive-plus

Mathematics Subject Classification ID

Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• Criteria for copositive matrices
• An algorithm for determining copositive matrices
• A copositivity probe
• Algorithms for determining the copositivity of a given symmetric matrix
• Criteria for copositive matrices

Cites work

• scientific article; zbMATH DE number 3543799 (Why is no real title available?)
• scientific article; zbMATH DE number 3356483 (Why is no real title available?)
• A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
• Almost copositive matrices
• Criteria for copositive matrices
• Determination of the inertia of a partitioned Hermitian matrix
• Least-index resolution of degeneracy in quadratic programming
• Some NP-complete problems in quadratic and nonlinear programming
• Testing the definiteness of matrices on polyhedral cones
• The general quadratic optimization problem

Cited in

(22)

• Copositive matrices, copositive programming, and applications
• Testing copositivity with the help of difference-of-convex optimization
• Algorithmic copositivity detection by simplicial partition
• scientific article; zbMATH DE number 2094817 (Why is no real title available?)
• Block pivoting and shortcut strategies for detecting copositivity
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Quadratic factorization heuristics for copositive programming
• Copositivity tests based on the linear complementarity problem
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
• The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems
• The copositive completion problem
• Determining subspaces on which a matrix is nonnegative definite
• Sparse solutions to random standard quadratic optimization problems
• Copositivity aspects of standard quadratic optimization problems
• Criteria for copositive matrices
• Algorithms for determining the copositivity of a given symmetric matrix
• Foundations of set-semidefinite optimization
• Copositive realxation for genera quadratic programming
• Copositivity and sparsity relations using spectral properties
• A copositivity probe
• An algorithm for determining copositive matrices
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision

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)