Pages that link to "Item:Q2494287"

The following pages link to On solving nonconvex optimization problems by reducing the duality gap (Q2494287):

Displaying 8 items.

• On local search in d.c. optimization problems (Q299416) (← links)
• Extended duality for nonlinear programming (Q707770) (← links)
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
• A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints (Q2425955) (← links)
• On a decomposition method for nonconvex global optimization (Q2463828) (← links)
• Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program (Q3553752) (← links)
• A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)