Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017

DOI10.4171/OWR/2017/52zbMath1409.00070OpenAlexW2905418927WikidataQ128723997 ScholiaQ128723997MaRDI QIDQ1731962

No author found.

Publication date: 15 March 2019

Published in: Oberwolfach Reports (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/owr/2017/52

Mathematics Subject Classification ID

Factorization of matrices (15A23) Semidefinite programming (90C22) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to linear algebra (15-06) Positive matrices and their generalizations; cones of matrices (15B48) Collections of abstracts of lectures (00B05)

Uses Software

• PERL
• CPLEX
• Polynomial Toolbox
• EDIM
• GraphGen
• FLO
• QuadProgBB
• SPOTless

Cites Work

• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Erratum to: On the DJL conjecture for order 6
• Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the DJL conjecture for order 6
• A Copositive Programming Approach to Graph Partitioning
• LMI Approximations for Cones of Positive Semidefinite Forms
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• On Cones of Nonnegative Quadratic Functions
• On copositive programming and standard quadratic optimization problems
• Copositivity tests based on the linear complementarity problem
• Considering copositivity locally
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic inequality generation scheme for polynomial programming
• Connecting sufficient conditions for the symmetric nonnegative inverse eigenvalue problem
• SPN graphs: when copositive = SPN
• A copositive formulation for the stability number of infinite graphs
• Copositive matrices with circulant zero support set
• Minimal zeros of copositive matrices
• From seven to eleven: completely positive matrices with high cp-rank
• Copositive optimization -- recent developments and applications
• An improved algorithm to test copositivity
• The extreme rays of the \(5 \times 5\) copositive cone
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• On the computational complexity of membership problems for the completely positive cone and its dual
• On polynomial optimization over non-compact semi-algebraic sets
• The \(\mathcal A\)-truncated \(K\)-moment problem
• The structure of completely positive matrices according to their CP-rank and CP-plus-rank
• Total positivity of sums, Hadamard products and Hadamard powers: results and counterexamples
• Characterization of completely positive graphs
• The inverse eigenvalue problem for nonnegative matrices
• A constructive version of the Boyle-Handelman theorem on the spectra of nonnegative matrices
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• A note on the computation of the CP-rank
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Transversality and alternating projections for nonconvex sets
• A unified view on compensation criteria in the real nonnegative inverse eigenvalue problem
• Exploiting equalities in polynomial programming
• A flexible model and efficient solution strategies for discrete location problems
• On the computation of \(C^*\) certificates
• Combinatorial results on completely positive matrices
• The spectra of nonnegative matrices via symbolic dynamics
• Copositive-plus Lemke algorithm solves polymatrix games
• Geometric algorithms and combinatorial optimization
• Eigenvalues of nonnegative symmetric matrices
• On standard quadratic optimization problems
• Robust solutions of uncertain linear programs
• Extreme nonnegative matrices
• Orthogonal bases that leads to symmetric nonnegative matrices
• The nonnegative inverse eigenvalue problem.
• Adjustable robust solutions of uncertain linear programs
• Conditionally definite matrices
• Dominant-set clustering: a review
• On the comparison of some realizability criteria for the real nonnegative inverse eigenvalue problem
• Sparsity in sums of squares of polynomials
• Building a completely positive factorization
• On copositive matrices
• CP rank of completely positive matrices of order 5
• Symmetry groups, semidefinite programs, and sums of squares
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• A characterization of trace zero nonnegative \(5\times 5\) matrices
• On copositive matrices with -1, 9, 1 entries
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
• On an extension of Pólya's Positivstellensatz
• A gentle, geometric introduction to copositive optimization
• Completely positive reformulations for polynomial optimization
• Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Rational factorizations of completely positive matrices
• Factorization and cutting planes for completely positive matrices by copositive projection
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Algorithmic copositivity detection by simplicial partition
• Minimizing polynomials via sum of squares over the gradient ideal
• Nonnegative realization of spectra having negative real parts
• Exact procedures for solving the discrete ordered median problem
• The trust region subproblem with non-intersecting linear constraints
• Extreme copositive quadratic forms. II
• On classes of copositive matrices
• Block pivoting and shortcut strategies for detecting copositivity
• Irreducible elements of the copositive cone
• Computable representations for convex hulls of low-dimensional quadratic forms
• Global Optimization with Polynomials and the Problem of Moments
• Linear Programming under Uncertainty
• Approximation of the Stability Number of a Graph via Copositive Programming
• A Two-Variable Approach to the Two-Trust-Region Subproblem
• Copositive Programming
• Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
• On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix
• Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
• New results on the cp-rank and related properties of co(mpletely )positive matrices
• Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
• Nonnegatively realizable spectra with two positive eigenvalues
• A Variational Approach to Copositive Matrices
• Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
• Location Theory
• A characterisation of common diagonal stability over cones
• Two-mode networks exhibiting data loss
• Open problems in the theory of completely positive and copositive matrices
• New Lower Bounds and Asymptotics for the cp-Rank
• New upper bounds for kissing numbers from semidefinite programming
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• The Operator $\Psi$ for the Chromatic Number of a Graph
• Constructing symmetric nonnegative matrices
• Some NP-complete problems in quadratic and nonlinear programming
• Bipartite completely positive matrices
• The real and the symmetric nonnegative inverse eigenvalue problems are different
• On the Matrix Equation X′X = A
• Inverse Elementary Divisor Problem for Nonnegative Matrices
• Towards a Practical Volumetric Cutting Plane Method for Convex Programming
• Remarks on completey positive matrices
• Completely positive matrices associated withM-matrices

This page was built for publication: Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017