Copositivity tests based on the linear complementarity problem
DOI10.1007/S10589-015-9772-2zbMATH Open1360.90245OpenAlexW2132130706MaRDI QIDQ5963680FDOQ5963680
Authors: Carmo P. Brás, Gabriele Eichfelder, Joaquim J. Júdice 
Publication date: 23 February 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00024543
Recommendations
Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for mathematical programming, optimization and variational techniques (65K99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A copositivity probe
- A variational approach to copositive matrices
- Algorithmic copositivity detection by simplicial partition
- An LP-based algorithm to test copositivity
- An improved 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
- 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 (13)
- Testing copositivity via mixed-integer linear programming
- An improved algorithm to test copositivity
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Gradient projection method on the sphere, complementarity problems and copositivity
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Solving Quadratic Programming by Cutting Planes
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- On sufficient properties of sufficient matrices
- 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
- Performance comparison of two recently proposed copositivity tests
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- An LP-based algorithm to test copositivity
Uses Software
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)
