An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
From MaRDI portal
Publication:5086010
Recommendations
- Factorization and cutting planes for completely positive matrices by copositive projection
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- A factorization method for completely positive matrices
- Completely positive matrices and positivity of least squares solutions
- scientific article; zbMATH DE number 1136351
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Matrix Analysis and Entrywise Positivity Preservers
- Matrix analysis and entrywise positivity preservers
- A Sufficient condition for strict total positivity of a matrix
- An analytic center cutting plane approach for conic programming
Cites work
- scientific article; zbMATH DE number 3516928 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- A cutting plane algorithm for convex programming that uses analytic centers
- A factorization method for completely positive matrices
- A mathematical view of interior-point methods in convex optimization
- A new certificate for copositivity
- A simplex algorithm for rational cp-factorization
- A variational approach to copositive matrices
- Algorithmic copositivity detection by simplicial partition
- An adaptive linear approximation algorithm for copositive programs
- Approximation of the stability number of a graph via copositive programming
- Building a completely positive factorization
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Covariance spaces for measures on polyhedral sets
- Distributionally robust mixed integer linear programs: persistency models with applications
- Extrémales du cône des matrices de type non négatif, à coefficients positifs ou nuls
- Factorization and cutting planes for completely positive matrices by copositive projection
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Linear inequalities and quadratic forms
- Linear-time complete positivity detection and decomposition of sparse matrices
- Matrix product constraints by projection methods
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- New approximations for the cone of copositive matrices and its dual
- On constrained optimization by adjoint based quasi-Newton methods
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On the computation of \(C^*\) certificates
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Open problems in the theory of completely positive and copositive matrices
- Quadratic factorization heuristics for copositive programming
- Scheduling arrivals to a stochastic service delivery system using copositive cones
- Separation and relaxation for cones of quadratic forms
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Some NP-complete problems in quadratic and nonlinear programming
- Testing copositivity via mixed-integer linear programming
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
Cited in
(5)
This page was built for publication: An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086010)
