Pages that link to "Item:Q946299"

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

Displaying 32 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 fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization (Q856089) (← links)
• A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
• An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint (Q1069860) (← links)
• Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions (Q1804585) (← links)
• Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
• FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions (Q2085471) (← links)
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
• An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program (Q2119757) (← links)
• Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem (Q2139271) (← links)
• Minimization of the ratio of functions defined as sums of the absolute values (Q2483046) (← links)
• Fractional programming with convex quadratic forms and functions (Q2496064) (← 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)
• (Q2751328) (← links)
• On the solution of a nonconvex fractional quadratic problem (Q2833995) (← links)
• Convex-concave fractional minimization problem (Q2910206) (← 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)
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
• An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives (Q3750534) (← links)
• Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)
• A Novel Approach for Solving Quadratic Fractional Programming Problems (Q5145056) (← links)
• A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)