Fractional programming with convex quadratic forms and functions
From MaRDI portal
Publication:2496064
Recommendations
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A method for fractional programming
- Fractional optimization problems
- On the quadratic fractional optimization with a strictly convex quadratic constraint.
- Maximizing for the sum of ratios of two convex functions over a convex set
Cites work
- A Successive Underestimation Method for Concave Minimization Problems
- An algorithm for indefinite integer quadratic programming
- An Algorithm for Separable Nonconvex Programming Problems
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Convex analysis and global optimization
- Encyclopedia of optimization. In 6 vols.
- Fractional programming - a survey
- Fractional Programming — Some Recent Developments
- Fractional programming: Applications and algorithms
- Generalized concavity
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3557508 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- Introduction to global optimization
- Maximization of the ratio of two convex quadratic functions over a polytope
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- On Nonlinear Fractional Programming
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Parametric approaches to fractional programs
Cited in
(35)- Conditional gradient method for double-convex fractional programming matrix problems
- A DEA ranking method based on cross-efficiency intervals and signal-to-noise ratio
- A parametric Sharpe ratio optimization approach for fuzzy portfolio selection problem
- A geometric branch and bound method for robust maximization of convex functions
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
- Pareto optimality conditions and duality for vector quadratic fractional optimization problems
- Strong duality for robust minimax fractional programming problems
- Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- 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)]
- Optimising portfolio diversification and dimensionality
- scientific article; zbMATH DE number 1664579 (Why is no real title available?)
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- A mathematical programming approach to sample coefficient of variation with interval-valued observations
- A method for fractional programming
- Convex-concave fractional minimization problem
- On the quadratic fractional optimization with a strictly convex quadratic constraint.
- Maximizing for the sum of ratios of two convex functions over a convex set
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Copositivity and constrained fractional quadratic problems
- Training Lp norm multiple kernel learning in the primal
- First-order algorithms for a class of fractional optimization problems
- Efficient algorithms for solving nonlinear fractional programming problems
- A semidefinite optimization approach to quadratic fractional optimization with a strictly convex quadratic constraint
- Maximizing the ratio of two convex functions over a convex set
- Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
- Maximization of the ratio of two convex quadratic functions over a polytope
- A combined algorithm for fractional programming
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- An implementable proximal extragradient method for structured fractional programming
- A review of recent advances in global optimization
- An efficient algorithm for solving convex-convex quadratic fractional programs
- A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
This page was built for publication: Fractional programming with convex quadratic forms and functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496064)
