Pages that link to "Item:Q1810525"

The following pages link to Difference of convex solution of quadratically constrained optimization problems. (Q1810525):

Displaying 6 items.

• A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
• SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
• An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
• A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
• A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256) (← links)
• A global optimization algorithm using linear relaxation (Q2507847) (← links)