Pages that link to "Item:Q930342"

The following pages link to New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342):

Displayed 41 items.

• Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) ‎ (← links)
• Sparse solutions to random standard quadratic optimization problems (Q378104) ‎ (← links)
• Copositivity and constrained fractional quadratic problems (Q403649) ‎ (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) ‎ (← links)
• An improved algorithm to test copositivity (Q427387) ‎ (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) ‎ (← links)
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) ‎ (← links)
• The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651) ‎ (← links)
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) ‎ (← links)
• A clique algorithm for standard quadratic programming (Q955308) ‎ (← links)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) ‎ (← links)
• Separable standard quadratic optimization problems (Q1758025) ‎ (← links)
• Separating doubly nonnegative and completely positive matrices (Q1942269) ‎ (← links)
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) ‎ (← links)
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) ‎ (← links)
• A new algorithm for concave quadratic programming (Q2010088) ‎ (← links)
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) ‎ (← links)
• Two-stage stochastic standard quadratic optimization (Q2077956) ‎ (← links)
• On solving a non-convex quadratic programming problem involving resistance distances in graphs (Q2177791) ‎ (← links)
• On sparsity of the solution to a random quadratic optimization problem (Q2227539) ‎ (← links)
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) ‎ (← links)
• A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) ‎ (← links)
• Metastability in stochastic replicator dynamics (Q2280198) ‎ (← 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 method for mean-variance portfolio optimization with cardinality constraints (Q2393351) ‎ (← links)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) ‎ (← links)
• Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) ‎ (← links)
• Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization (Q2448210) ‎ (← links)
• Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program (Q2450669) ‎ (← links)
• Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (Q2458903) ‎ (← links)
• Copositivity cuts for improving SDP bounds on the clique number (Q2638373) ‎ (← links)
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) ‎ (← links)
• Gap, cosum and product properties of the θ′ bound on the clique number (Q3066919) ‎ (← links)
• New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions (Q3449456) ‎ (← links)
• Solving Quadratic Programming by Cutting Planes (Q4634098) ‎ (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) ‎ (← links)
• Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) ‎ (← links)
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) ‎ (← links)
• Performance comparison of two recently proposed copositivity tests (Q6114943) ‎ (← links)
• Nonparametric density estimation with nonuniform B-spline bases (Q6126078) ‎ (← links)