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 22 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method (Q1807931) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← 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)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← 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)
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program (Q3105771) (← links)
- On Zero Duality Gap and the Farkas Lemma for Conic Programming (Q3169012) (← 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)
- An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints (Q5857291) (← links)
- On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games (Q6114782) (← links)
