Global optimization algorithm for sum of generalized polynomial ratios problem
From MaRDI portal
Publication:345766
DOI10.1016/j.apm.2012.02.023zbMath1349.90693OpenAlexW2030748644MaRDI QIDQ345766
Hong-Wei Jiao, Zhankui Wang, Yong-Qiang Chen
Publication date: 2 December 2016
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.02.023
global optimizationbranch and boundsum of generalized polynomial ratiosthree-level linear relaxation method
Related Items (20)
Regional division and reduction algorithm for minimizing the sum of linear fractional functions ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ Mathematical modeling of spacecraft guidance and control system in 3D space orbit transfer mission ⋮ An efficient algorithm for computing a class of multiplicative optimization problem ⋮ A linearized relaxing algorithm for the specific nonlinear optimization problem ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ A new deterministic global computing algorithm for solving a kind of linear fractional programming ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ Global minimization for generalized polynomial fractional program ⋮ Global optimization for the sum of certain nonlinear functions ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ A parametric solution method for a generalized fractional programming problem ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- Unnamed Item
- Global optimization for the generalized polynomial sum of ratios problem
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Global optimization of nonlinear sum of ratios problem
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A deterministic global optimization algorithm
- A hybrid simplex search and particle swarm optimization for unconstrained optimization
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A note on a deterministic global optimization algorithm
- 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
- An improved particle swarm optimization algorithm
- Solving sum of quadratic ratios fractional programs via monotonic function
- Global optimization for a class of fractional programming problems
- Optimization on low rank nonconvex structures
- 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
- Optimization of polynomial fractional functions
- Using conical partition to globally maximizing the nonlinear sum of ratios
- A note on the paper ``Global optimization of nonlinear sum of ratios
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Global optimization for the sum of generalized polynomial fractional functions
- Improved particle swarm algorithms for global optimization
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Convex analysis and global optimization
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Maximization of the ratio of two convex quadratic functions over a polytope
- Global optimization algorithm for the nonlinear sum of ratios problem
This page was built for publication: Global optimization algorithm for sum of generalized polynomial ratios problem
