Pages that link to "Item:Q4391292"
From MaRDI portal
The following pages link to Semidefinite relaxation and nonconvex quadratic optimization (Q4391292):
Displaying 50 items.
- A semi-definite programming approach for robust tracking (Q263222) (← links)
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
- Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
- Barrier subgradient method (Q633113) (← links)
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement (Q635824) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- On box-constrained total least squares problem (Q827567) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- A \({\mathsf{D}}\)-induced duality and its applications (Q925269) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- Semidefinite programming relaxation for nonconvex quadratic programs (Q1361074) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- Quadratic maximization and semidefinite relaxation (Q1575069) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading (Q1653283) (← links)
- Semidefinite relaxation and new conditions for sign-definiteness of the quadratic form under quadratic constraints (Q1717053) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Interval solutions for interval algebraic equations (Q1826594) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
- Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- Two proposals for robust PCA using semidefinite programming (Q1952221) (← links)
- Radar waveform design for extended target recognition under detection constraints (Q1954613) (← links)
- Simplicial faces of the set of correlation matrices (Q1991097) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
- Statistical quality assessment of Ising-based annealer outputs (Q2101593) (← links)
