Range division and compression algorithm for quadratically constrained sum of quadratic ratios
From MaRDI portal
Publication:520268
DOI10.1007/S40314-015-0224-5zbMATH Open1359.90140OpenAlexW2010832590MaRDI QIDQ520268FDOQ520268
Authors: Sanyang Liu, Hong-Wei Jiao 
Publication date: 3 April 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-015-0224-5
Recommendations
- An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
- Range division and linearization algorithm for a class of linear ratios optimization problems
- An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
global optimizationbranch and boundcompression techniquelinear relaxation approachsum of quadratic ratios
Cites Work
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Title not available (Why is that?)
- Global optimization algorithm for the nonlinear sum of ratios problem
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- A global optimization algorithm for linear fractional programming
- An approach to constrained global optimization based on exact penalty functions
- Global optimization for a class of fractional programming problems
- A unified monotonic approach to generalized linear fractional programming
- Minimization of the sum of three linear fractional functions
- Conical partition algorithm for maximizing the sum of dc ratios
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Global optimization for sum of generalized fractional functions
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization of nonlinear sum of ratios problem
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Solving the sum-of-ratios problems by a harmony search algorithm
- Solving sum of quadratic ratios fractional programs via monotonic function
- Global optimization for the sum of generalized polynomial fractional functions
- Maximizing for the sum of ratios of two convex functions over a convex set
- A global optimization algorithm for sum of linear ratios problem
- Optimization on low rank nonconvex structures
- Optimization of polynomial fractional functions
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Global optimization for the generalized polynomial sum of ratios problem
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A nonsmooth global optimization technique using slopes: The one-dimensional case
- Financial planning with fractional goals
Cited In (17)
- Perturbation bounds for the metric projection of a point onto a linear manifold in reflexive strictly convex Banach spaces
- An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- A linear-time algorithm for globally maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- Two-level linear relaxation method for generalized linear fractional programming
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- A parametric linearizing approach for quadratically inequality constrained quadratic programs
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems
This page was built for publication: Range division and compression algorithm for quadratically constrained sum of quadratic ratios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520268)
