Copositive Programming
From MaRDI portal
Publication:2802526
DOI10.1007/978-1-4614-0769-0_8zbMath1334.90098OpenAlexW4248179398MaRDI QIDQ2802526
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
Semidefinite programming (90C22) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Modularity maximization using completely positive programming, On conic QPCCs, conic QCQPs and completely positive programs, Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, Improved Conic Reformulations for $K$-means Clustering, SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY, Interplay of non-convex quadratically constrained problems with adjustable robust optimization, New results on the cp-rank and related properties of co(mpletely )positive matrices, Moment approximations for set-semidefinite polynomials, Completely positive reformulations of polynomial optimization problems with linear constraints, A fresh CP look at mixed-binary QPs: new formulations and relaxations, A new certificate for copositivity, From seven to eleven: completely positive matrices with high cp-rank, Copositivity and constrained fractional quadratic problems, Optimization under uncertainty and risk: quadratic and copositive approaches, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Hermitian completely positive matrices, Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization, Copositive optimization -- recent developments and applications, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, Representing quadratically constrained quadratic programs as generalized copositive programs, Genericity Results in Linear Conic Programming—A Tour d’Horizon, On the computational complexity of membership problems for the completely positive cone and its dual, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, New approximations for the cone of copositive matrices and its dual, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, A guide to conic optimisation and its applications, The structure of completely positive matrices according to their CP-rank and CP-plus-rank, Optimization over structured subsets of positive semidefinite matrices via column generation, Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality, A MAX-CUT formulation of 0/1 programs, QPLIB: a library of quadratic programming instances, Building a completely positive factorization, A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming, Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices, On sufficient properties of sufficient matrices, Profit Sharing Agreements in Decentralized Supply Chains: A Distributionally Robust Approach, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Robust Quadratic Programming with Mixed-Integer Uncertainty, Unnamed Item, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, Two-stage stochastic standard quadratic optimization, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, A gentle, geometric introduction to copositive optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive and semidefinite relaxations of the quadratic assignment problem
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A note on the computation of the CP-rank
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- 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
- A note on Burer's copositive representation of mixed-binary QPs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Computable representations for convex hulls of low-dimensional quadratic forms
- Partial Lagrangian relaxation for general quadratic programming
- Lectures on Modern Convex Optimization
- Approximation of the Stability Number of a Graph via Copositive Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Variational Approach to Copositive Matrices
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
- The Operator $\Psi$ for the Chromatic Number of a Graph
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Some NP-complete problems in quadratic and nonlinear programming
- On the Matrix Equation X′X = A
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A Copositive Programming Approach to Graph Partitioning
- On Cones of Nonnegative Quadratic Functions
- On copositive programming and standard quadratic optimization problems
