An efficient algorithm for solving convex-convex quadratic fractional programs
From MaRDI portal
Recommendations
- Fractional programming with convex quadratic forms and functions
- A combined algorithm for fractional programming
- An Exact Method for a Discrete Quadratic Fractional Maximum Problem
- Maximization of the ratio of two convex quadratic functions over a polytope
- An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 2005717 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Fractional Programming. II, On Dinkelbach's Algorithm
- Global optimization of fractional programs
- Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
- Integer programming approaches in mean-risk models
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- Maximization of the ratio of two convex quadratic functions over a polytope
- On Nonlinear Fractional Programming
- Optimization on low rank nonconvex structures
- Parametric approaches to fractional programs
- Programming with linear fractional functionals
Cited in
(39)- On low-rank convex-convex quadratic fractional programming
- Efficient local search procedures for quadratic fractional programming problems
- A maximal predictability portfolio using dynamic factor selection strategy
- A novel approach for solving quadratic fractional programming problems
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
- An Exact Method for a Discrete Quadratic Fractional Maximum Problem
- scientific article; zbMATH DE number 1664579 (Why is no real title available?)
- scientific article; zbMATH DE number 2068052 (Why is no real title available?)
- Global optimization for a class of nonlinear sum of ratios problem
- A combined algorithm for fractional programming
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- A review of recent advances in global optimization
- Convex optimization approaches to maximally predictable portfolio selection
- On the quadratic fractional optimization with a strictly convex quadratic constraint.
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- Copositivity and constrained fractional quadratic problems
- Maximizing for the sum of ratios of two convex functions over a convex set
- Minimization of the ratio of functions defined as sums of the absolute values
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Optimising portfolio diversification and dimensionality
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
- Convex-concave fractional minimization problem
- A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION
- Maximization of the ratio of two convex quadratic functions over a polytope
- A MAXIMAL PREDICTABILITY PORTFOLIO SUBJECT TO A TURNOVER CONSTRAINT
- Fractional programming with convex quadratic forms and functions
- Observer-based asymptotic active fault diagnosis: separate and joint design of observer gain and input
- On the solution of a nonconvex fractional quadratic problem
- An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives
- An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint
- A maximal predictability portfolio using absolute deviation reformulation
- FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions
- A new input design method for online active fault diagnosis based on sum-of-ratios optimization
- Efficient algorithms for solving nonlinear fractional programming problems
- Global minimization for generalized polynomial fractional program
This page was built for publication: An efficient algorithm for solving convex-convex quadratic fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946299)
