Pages that link to "Item:Q1575069"

The following pages link to Quadratic maximization and semidefinite relaxation (Q1575069):

Displaying 33 items.

• On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
• Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
• Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← 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)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
• Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
• On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
• Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
• On the local stability of semidefinite relaxations (Q2144546) (← links)
• Frequency-hopping code design for Target detection via optimization theory (Q2275335) (← links)
• A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
• Credible autocoding of convex optimization algorithms (Q2358081) (← links)
• Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization (Q2448210) (← links)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems (Q2810546) (← links)
• Lagrangian Duality in Complex Pose Graph Optimization (Q2957706) (← links)
• On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l₁</i>unit ball (Q3635701) (← links)
• A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470655) (← links)
• A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470658) (← links)
• Convexity/Nonconvexity Certificates for Power Flow Analysis (Q4687400) (← links)
• (Q5053241) (← links)
• Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
• An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
• Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications (Q6180358) (← links)