An Adaptive Linear Approximation Algorithm for Copositive Programs
From MaRDI portal
Publication:5189550
DOI10.1137/070711815zbMath1187.90187OpenAlexW2144560699MaRDI QIDQ5189550
Publication date: 17 March 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070711815
Quadratic programming (90C20) Linear programming (90C05) Positive matrices and their generalizations; cones of matrices (15B48) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Quadratic and bilinear forms, inner products (15A63)
Related Items
On the accuracy of uniform polyhedral approximations of the copositive cone ⋮ On standard quadratic programs with exact and inexact doubly nonnegative relaxations ⋮ Myopic Bounds for Optimal Policy of POMDPs: An Extension of Lovejoy’s Structural Results ⋮ Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ On the copositive representation of binary and continuous nonconvex quadratic programs ⋮ On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Copositivity and constrained fractional quadratic problems ⋮ A simplified completely positive reformulation for binary quadratic programs ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ (Global) optimization: historical notes and recent developments ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Approximation hierarchies for copositive cone over symmetric cone and their comparison ⋮ Separating doubly nonnegative and completely positive matrices ⋮ Copositive optimization -- recent developments and applications ⋮ Copositive tensor optimization problem and its applications to hypergraphs ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An improved algorithm to test copositivity ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ Copositive programming via semi-infinite optimization ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ Representing quadratically constrained quadratic programs as generalized copositive programs ⋮ On the computational complexity of membership problems for the completely positive cone and its dual ⋮ Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques ⋮ On sparsity of the solution to a random quadratic optimization problem ⋮ Exceptional family and solvability of copositive complementarity problems ⋮ Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations ⋮ Analysis of copositive optimization based linear programming bounds on standard quadratic optimization ⋮ Completely positive and copositive program modelling for quadratic optimization problems ⋮ A new branch-and-bound algorithm for standard quadratic programming problems ⋮ Contribution of copositive formulations to the graph partitioning problem ⋮ Adaptive computable approximation to cones of nonnegative quadratic functions ⋮ Quadratic factorization heuristics for copositive programming ⋮ Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations ⋮ Copositive Programming ⋮ Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams ⋮ Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices ⋮ An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs ⋮ Strong duality for general quadratic programs with quadratic equality constraints ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ A study on sequential minimal optimization methods for standard quadratic problems ⋮ Completely positive reformulations for polynomial optimization ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
This page was built for publication: An Adaptive Linear Approximation Algorithm for Copositive Programs
