Pages that link to "Item:Q496589"
From MaRDI portal
The following pages link to Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589):
Displaying 15 items.
- A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (Q1812072) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Copositivity aspects of standard quadratic optimization problems (Q2725640) (← links)
- On the accuracy of uniform polyhedral approximations of the copositive cone (Q2885468) (← links)
- (Q2941669) (← links)
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis (Q4594850) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
- On copositive programming and standard quadratic optimization problems (Q5929997) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations (Q6665387) (← links)
