Copositive programming
From MaRDI portal
Publication:2802526
DOI10.1007/978-1-4614-0769-0_8zbMATH Open1334.90098OpenAlexW4248179398MaRDI QIDQ2802526FDOQ2802526
Authors: Samuel Burer 
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_8
Recommendations
- Copositive matrices, copositive programming, and applications
- An adaptive linear approximation algorithm for copositive programs
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive programming via semi-infinite optimization
Linear programming (90C05) Semidefinite programming (90C22) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cites Work
- Title not available (Why is that?)
- A Newton-CG augmented Lagrangian method for semidefinite programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Some NP-complete problems in quadratic and nonlinear programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- Interior points of the completely positive cone
- An adaptive linear approximation algorithm for copositive programs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On Cones of Nonnegative Quadratic Functions
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A variational approach to copositive matrices
- On the Matrix Equation X′X = A
- Title not available (Why is that?)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Separating doubly nonnegative and completely positive matrices
- Separation and relaxation for cones of quadratic forms
- The Operator $\Psi$ for the Chromatic Number of a Graph
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Computable representations for convex hulls of low-dimensional quadratic forms
- On copositive programming and standard quadratic optimization problems
- Partial Lagrangian relaxation for general quadratic programming
- A note on the computation of the CP-rank
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- A note on Burer's copositive representation of mixed-binary QPs
- A Copositive Programming Approach to Graph Partitioning
- Title not available (Why is that?)
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
Cited In (51)
- Two-stage stochastic standard quadratic optimization
- Lower bounds for maximal cp-ranks of completely positive matrices and tensors
- QPLIB: a library of quadratic programming instances
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Modularity maximization using completely positive programming
- On conic QPCCs, conic QCQPs and completely positive programs
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- A guide to conic optimisation and its applications
- Improved Conic Reformulations for $K$-means Clustering
- On the computational complexity of membership problems for the completely positive cone and its dual
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- The structure of completely positive matrices according to their CP-rank and CP-plus-rank
- Copositive optimization -- recent developments and applications
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Robust quadratic programming with mixed-integer uncertainty
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- A new certificate for copositivity
- Representing quadratically constrained quadratic programs as generalized copositive programs
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Copositive matrices, copositive programming, and applications
- Building a completely positive factorization
- Copositivity and constrained fractional quadratic problems
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Hermitian completely positive matrices
- On sufficient properties of sufficient matrices
- From seven to eleven: completely positive matrices with high cp-rank
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Profit sharing agreements in decentralized supply chains: a distributionally robust approach
- Genericity results in linear conic programming -- a tour d'horizon
- Completely positive reformulations of polynomial optimization problems with linear constraints
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- A copositive framework for analysis of hybrid Ising-classical algorithms
- A MAX-CUT formulation of 0/1 programs
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Optimization under uncertainty and risk: quadratic and copositive approaches
- A discretization method for a class of copositive programming problems
- Non-exposed polyhedral faces of the completely positive cone
- Copositive programming via semi-infinite optimization
- New approximations for the cone of copositive matrices and its dual
- Moment approximations for set-semidefinite polynomials
- A gentle, geometric introduction to copositive optimization
- New results on the cp-rank and related properties of co(mpletely) positive matrices
This page was built for publication: Copositive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802526)
