Copositivity tests based on the linear complementarity problem
From MaRDI portal
(Redirected from Publication:5963680)
Recommendations
Cites work
- A copositivity probe
- A variational approach to copositive matrices
- Algorithmic copositivity detection by simplicial partition
- An improved algorithm to test copositivity
- An LP-based algorithm to test copositivity
- Approximation of the stability number of a graph via copositive programming
- Copositive matrices, copositive programming, and applications
- Copositive optimization -- recent developments and applications
- Copositive programming by simplicial partition
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Criteria for copositive matrices
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- Introduction to global optimization.
- On copositive matrices with -1, 9, 1 entries
- On standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the solution of NP-hard linear complementarity problems
- Quadratic-programming criteria for copositive matrices
- Some NP-complete problems in quadratic and nonlinear programming
- The Linear Complementarity Problem
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
Cited in
(14)- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- On sufficient properties of sufficient matrices
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Testing copositivity via mixed-integer linear programming
- An improved algorithm to test copositivity
- Solving Quadratic Programming by Cutting Planes
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- An LP-based algorithm to test copositivity
- Performance comparison of two recently proposed copositivity tests
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- A copositive framework for analysis of hybrid Ising-classical algorithms
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- Gradient projection method on the sphere, complementarity problems and copositivity
- New predictor-corrector interior-point algorithm with AET function having inflection points
This page was built for publication: Copositivity tests based on the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963680)
