Pages that link to "Item:Q4391292"

The following pages link to Semidefinite relaxation and nonconvex quadratic optimization (Q4391292):

Displaying 24 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)
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← 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)
• Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers (Q4993313) (← links)
• Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
• Non-unique games over compact groups and orientation estimation in cryo-EM (Q5000617) (← links)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
• Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
• Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions (Q5383906) (← links)
• A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
• Tight computationally efficient approximation of matrix norms with applications (Q6114892) (← links)
• An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
• Effective algorithms for optimal portfolio deleveraging problem with cross impact (Q6178391) (← links)