Pages that link to "Item:Q263189"

The following pages link to A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189):

Displaying 31 items.

• Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
• Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
• ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
• Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
• Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
• Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
• Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
• On construction of upper and lower bounds for the HOMO-LUMO spectral gap (Q2273100) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
• Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations (Q2834695) (← links)
• Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
• Algorithm 996 (Q4960955) (← links)
• A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)
• A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
• A regularization-patching dual quaternion optimization method for solving the hand-eye calibration problem (Q6151594) (← links)