An adaptive linear approximation algorithm for copositive programs
From MaRDI portal
Recommendations
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Quadratic factorization heuristics for copositive programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Copositive matrices, copositive programming, and applications
- Approximation of copositive programming via linear programming using second order sum of square decomposition
Cited in
(56)- A simplified completely positive reformulation for binary quadratic programs
- On the accuracy of uniform polyhedral approximations of the copositive cone
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Approximation of copositive programming via linear programming using second order sum of square decomposition
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- On sparsity of the solution to a random quadratic optimization problem
- On conic QPCCs, conic QCQPs and completely positive programs
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- An improved algorithm to test copositivity
- On the computational complexity of membership problems for the completely positive cone and its dual
- Quadratic factorization heuristics for copositive programming
- Exceptional family and solvability of copositive complementarity problems
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Completely positive and copositive program modelling for quadratic optimization problems
- Myopic bounds for optimal policy of POMDPs: an extension of lovejoy's structural results
- Copositive optimization -- recent developments and applications
- Stability analysis of discrete-time linear complementarity systems
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- On tractable convex relaxations of standard quadratic optimization problems under sparsity constraints
- Strong duality for general quadratic programs with quadratic equality constraints
- Exploiting cone approximations in an augmented Lagrangian method for conic optimization
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Representing quadratically constrained quadratic programs as generalized copositive programs
- A new branch-and-bound algorithm for standard quadratic programming problems
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Copositivity and constrained fractional quadratic problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Copositive tensor optimization problem and its applications to hypergraphs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Separating doubly nonnegative and completely positive matrices
- Contribution of copositive formulations to the graph partitioning problem
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Completely positive reformulations for polynomial optimization
- Factorization and cutting planes for completely positive matrices by copositive projection
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Conic optimization techniques yield sufficient conditions for set-completely positive matrix completion under arrowhead specification pattern
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Copositive programming
- 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
- Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Copositive programming via semi-infinite optimization
- Instance-specific linear relaxations of semidefinite optimization problems
- New approximations for the cone of copositive matrices and its dual
- (Global) optimization: historical notes and recent developments
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- A study on sequential minimal optimization methods for standard quadratic problems
- Copositive programming by simplicial partition
This page was built for publication: An adaptive linear approximation algorithm for copositive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189550)
