Pages that link to "Item:Q520268"
From MaRDI portal
The following pages link to Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268):
Displaying 16 items.
- Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
- An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients (Q1993432) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems (Q2423805) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- Perturbation bounds for the metric projection of a point onto a linear manifold in reflexive strictly convex Banach spaces (Q5086886) (← links)
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere (Q5231687) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
