Pages that link to "Item:Q421278"
From MaRDI portal
The following pages link to On zero duality gap in nonconvex quadratic programming problems (Q421278):
Displaying 12 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Worst-case analysis of Gini mean difference safety measure (Q1983716) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- First- and second-order optimality conditions for quadratically constrained quadratic programming problems (Q2139247) (← links)
- On the local stability of semidefinite relaxations (Q2144546) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
- On the quadratic fractional optimization with a strictly convex quadratic constraint (Q2948116) (← links)
- Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique (Q3466283) (← links)
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint (Q4639117) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games (Q6114782) (← links)
