Pages that link to "Item:Q2383678"

The following pages link to An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678):

Displaying 12 items.

• Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
• A global optimization algorithm for sum of quadratic ratios problem with coefficients (Q440994) (← links)
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
• Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
• Global optimization for sum of geometric fractional functions (Q983970) (← links)
• Solving sum of quadratic ratios fractional programs via monotonic function (Q1026289) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
• A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
• Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
• On solving the sum-of-ratios problem (Q2422872) (← links)
• A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)