An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix

DOI10.1287/ijoc.2021.1108OpenAlexW3210079594MaRDI QIDQ5086010

Etienne de Klerk, Riley Badenbroek

Publication date: 30 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.05319

zbMATH Keywords

completely positive matricescopositive optimizationanalytic center cutting plane method

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

CopositiveAnalyticCenter.jl ⋮ A simple method for convex optimization in the oracle model ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches

Uses Software

• GitHub
• quadprogIP

Cites Work

• Unnamed Item
• Unnamed Item
• Distributionally robust mixed integer linear programs: persistency models with applications
• On the computational complexity of membership problems for the completely positive cone and its dual
• The \(\mathcal A\)-truncated \(K\)-moment problem
• Quadratic factorization heuristics for copositive programming
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• Linear inequalities and quadratic forms
• On the computation of \(C^*\) certificates
• Covariance spaces for measures on polyhedral sets
• Matrix product constraints by projection methods
• Building a completely positive factorization
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Extrémales du cône des matrices de type non négatif, à coefficients positifs ou nuls
• A cutting plane algorithm for convex programming that uses analytic centers
• Separation and relaxation for cones of quadratic forms
• A simplex algorithm for rational cp-factorization
• A factorization method for completely positive matrices
• Testing copositivity via mixed-integer linear programming
• On the copositive representation of binary and continuous nonconvex quadratic programs
• A new certificate for copositivity
• Factorization and cutting planes for completely positive matrices by copositive projection
• New approximations for the cone of copositive matrices and its dual
• Algorithmic copositivity detection by simplicial partition
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Approximation of the Stability Number of a Graph via Copositive Programming
• Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
• On the accuracy of uniform polyhedral approximations of the copositive cone
• A Variational Approach to Copositive Matrices
• Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
• Open problems in the theory of completely positive and copositive matrices
• Some NP-complete problems in quadratic and nonlinear programming
• Towards a Practical Volumetric Cutting Plane Method for Convex Programming
• On constrained optimization by adjoint based quasi-Newton methods
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• An Adaptive Linear Approximation Algorithm for Copositive Programs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

This page was built for publication: An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix