The following pages link to (Q5292090):
Displaying 42 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations (Q2116587) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A convex optimisation framework for the unequal-areas facility layout problem (Q2275810) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- New quadratic models for the maximum weighted cut problem (Q2501328) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Optimal Learning in Linear Regression with Combinatorial Feature Selection (Q2960366) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
