Range division and compression algorithm for quadratically constrained sum of quadratic ratios
type: Item
instance of: scholarly article
title: Range division and compression algorithm for quadratically constrained sum of quadratic ratios
zbMATH Open document ID: 1359.90140
author: Sanyang Liu
author: Hong-Wei Jiao
published in: Computational and Applied Mathematics
publication date: 2017-04-03T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6699570
zbMATH Keywords: sum of quadratic ratios
zbMATH Keywords: global optimization
zbMATH Keywords: linear relaxation approach
zbMATH Keywords: branch and bound
zbMATH Keywords: compression technique
MaRDI profile type: Publication
full work available at URL: s40314-015-0224-5
OpenAlex ID: W2010832590
cites work: Global optimization algorithm for the nonlinear sum of ratios problem
cites work: A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints
cites work: Global optimization for a class of fractional programming problems
cites work: A global optimization algorithm for sum of linear ratios problem
cites work: Financial planning with fractional goals
cites work: Solving the sum-of-ratios problems by a harmony search algorithm
cites work: A global optimization algorithm for sum of quadratic ratios problem with coefficients
cites work: A branch and bound algorithm for globally solving a class of nonconvex programming problems
cites work: Global optimization algorithm for sum of generalized polynomial ratios problem
cites work: A practicable branch and bound algorithm for sum of linear ratios problem
cites work: Optimization on low rank nonconvex structures
cites work: Minimization of the sum of three linear fractional functions
cites work: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
cites work: Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
cites work: A unified monotonic approach to generalized linear fractional programming
cites work: An approach to constrained global optimization based on exact penalty functions
cites work: An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
cites work: A nonsmooth global optimization technique using slopes: The one-dimensional case
cites work: Global optimization for the sum of generalized polynomial fractional functions
cites work: Global optimization for sum of generalized fractional functions
cites work: A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
cites work: Solving sum of quadratic ratios fractional programs via monotonic function
cites work: Using conical partition to globally maximizing the nonlinear sum of ratios
cites work: Global optimization for the generalized polynomial sum of ratios problem
cites work: Maximizing for the sum of ratios of two convex functions over a convex set
cites work: Q4368736
cites work: Optimization of polynomial fractional functions
cites work: Global optimization of nonlinear sum of ratios problem
cites work: A branch and bound algorithm to globally solve the sum of several linear ratios
cites work: A global optimization algorithm for linear fractional programming
cites work: Conical partition algorithm for maximizing the sum of dc ratios
DOI: 10.1007/S40314-015-0224-5
description: scientific article; zbMATH DE number 6699570