Copositivity tests based on the linear complementarity problem
From MaRDI portal
Publication:5963680
DOI10.1007/s10589-015-9772-2zbMath1360.90245MaRDI QIDQ5963680
Joaquim Joao Júdice, Carmo P. Brás, Gabriele Eichfelder
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
90C26: Nonconvex programming, global optimization
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
65K99: Numerical methods for mathematical programming, optimization and variational techniques
Related Items
Solving Quadratic Programming by Cutting Planes, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- An improved algorithm to test copositivity
- On the solution of NP-hard linear complementarity problems
- Criteria for copositive matrices
- On standard quadratic optimization problems
- Quadratic-programming criteria for copositive matrices
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- On copositive matrices with -1, 9, 1 entries
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Algorithmic copositivity detection by simplicial partition
- Approximation of the Stability Number of a Graph via Copositive Programming
- A Variational Approach to Copositive Matrices
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- The Linear Complementarity Problem
- Some NP-complete problems in quadratic and nonlinear programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Introduction to global optimization.
- A copositivity probe
