An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
From MaRDI portal
Recommendations
- Global optimization algorithm for sum of quadratic ratios problem
- An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- On solving the quadratic sum-of-ratios problems
- Solving sum-of-ratios fractional programs using efficient points
Cited in
(26)- A parametric linearizing approach for quadratically inequality constrained quadratic programs
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
- Efficient local search procedures for quadratic fractional programming problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- 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
- A solution approach for cardinality minimization problem based on fractional programming
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- On solving the quadratic sum-of-ratios problems
- Solving sum-of-ratios fractional programs using efficient points
- An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Perturbation of the Moore-Penrose metric generalized inverse with applications to the best approximate solution problem in L^p(, )
- Solving generalized polynomial problem by using new affine relaxed technique
- Perturbation bounds for the metric projection of a point onto a linear manifold in reflexive strictly convex Banach spaces
- The Sherman-Morrison-Woodbury formula for the Moore-Penrose metric generalized inverse
- Two-level linear relaxation method for generalized linear fractional programming
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation
- On low-rank convex-convex quadratic fractional programming
- Enhanced interval quadratic fractional programming for maximizing Sharpe ratio in portfolio optimization
This page was built for publication: An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602158)
