Pages that link to "Item:Q1876594"
From MaRDI portal
The following pages link to Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches (Q1876594):
Displaying 13 items.
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- Testing copositivity with the help of difference-of-convex optimization (Q359631) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions (Q871665) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- A difference of convex formulation of value-at-risk constrained optimization (Q3577837) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)
