Pages that link to "Item:Q2496064"

The following pages link to Fractional programming with convex quadratic forms and functions (Q2496064):

Displaying 31 items.

• A mathematical programming approach to sample coefficient of variation with interval-valued observations (Q286182) (← links)
• Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
• Copositivity and constrained fractional quadratic problems (Q403649) (← links)
• Training Lp norm multiple kernel learning in the primal (Q461152) (← links)
• Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints (Q550510) (← links)
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• An efficient algorithm for solving convex-convex quadratic fractional programs (Q946299) (← links)
• A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming (Q949520) (← links)
• A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
• Conditional gradient method for double-convex fractional programming matrix problems (Q1706413) (← links)
• A DEA ranking method based on cross-efficiency intervals and signal-to-noise ratio (Q1708523) (← links)
• A parametric Sharpe ratio optimization approach for fuzzy portfolio selection problem (Q1992962) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
• Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem (Q2139271) (← links)
• Pareto optimality conditions and duality for vector quadratic fractional optimization problems (Q2336897) (← links)
• Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
• Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems (Q2423805) (← links)
• Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
• A note on the paper ``Fractional programming with convex quadratic forms and functions'' by \textit{H. P. Benson} [Eur. J. Oper. Res. 173, No. 2, 351--369 (2006; Zbl 1113.90122)] (Q2432939) (← links)
• Optimising portfolio diversification and dimensionality (Q2679246) (← links)
• (Q2751328) (← links)
• Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems (Q2810107) (← links)
• A method for fractional programming (Q2892253) (← links)
• Convex-concave fractional minimization problem (Q2910206) (← links)
• On the quadratic fractional optimization with a strictly convex quadratic constraint (Q2948116) (← links)
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
• First-Order Algorithms for a Class of Fractional Optimization Problems (Q5026841) (← links)
• Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)
• Maximizing the ratio of two convex functions over a convex set (Q5438529) (← links)