Quadratic-programming criteria for copositive matrices
From MaRDI portal
Publication:1823293
DOI10.1016/0024-3795(89)90076-1zbMath0681.15012OpenAlexW2053882461WikidataQ114852094 ScholiaQ114852094MaRDI QIDQ1823293
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
algorithmlinear programmingquadratic programmingsimplex methodcopositive matricesNP-complete problemcopositive-plus
Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (15)
Sparse solutions to random standard quadratic optimization problems ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An algorithm for determining copositive matrices ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems ⋮ Determining subspaces on which a matrix is nonnegative definite ⋮ Copositivity and sparsity relations using spectral properties ⋮ Algorithmic copositivity detection by simplicial partition ⋮ Algorithms for determining the copositivity of a given symmetric matrix ⋮ Copositive realxation for genera quadratic programming ⋮ Foundations of Set-Semidefinite Optimization ⋮ Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems ⋮ Copositivity tests based on the linear complementarity problem ⋮ Block pivoting and shortcut strategies for detecting copositivity ⋮ The copositive completion problem
Cites Work
- Unnamed Item
- Unnamed Item
- Criteria for copositive matrices
- Testing the definiteness of matrices on polyhedral cones
- Almost copositive matrices
- Determination of the inertia of a partitioned Hermitian matrix
- Some NP-complete problems in quadratic and nonlinear programming
- Least-index resolution of degeneracy in quadratic programming
- The general quadratic optimization problem
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
This page was built for publication: Quadratic-programming criteria for copositive matrices