Pages that link to "Item:Q946299"

The following pages link to An efficient algorithm for solving convex-convex quadratic fractional programs (Q946299):

Displaying 18 items.

• Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
• Copositivity and constrained fractional quadratic problems (Q403649) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
• Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions (Q2085471) (← links)
• Minimization of the ratio of functions defined as sums of the absolute values (Q2483046) (← links)
• A maximal predictability portfolio using absolute deviation reformulation (Q2655748) (← links)
• A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
• Optimising portfolio diversification and dimensionality (Q2679246) (← links)
• Convex optimization approaches to maximally predictable portfolio selection (Q2926485) (← links)
• On the quadratic fractional optimization with a strictly convex quadratic constraint (Q2948116) (← links)
• A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION (Q3503130) (← links)
• A MAXIMAL PREDICTABILITY PORTFOLIO SUBJECT TO A TURNOVER CONSTRAINT (Q3560104) (← links)
• A MAXIMAL PREDICTABILITY PORTFOLIO USING DYNAMIC FACTOR SELECTION STRATEGY (Q3580214) (← links)
• Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)
• A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)