An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
From MaRDI portal
Publication:2383678
DOI10.1016/j.amc.2006.12.034zbMath1126.65056OpenAlexW2030427207MaRDI QIDQ2383678
Jiakun Zhao, Ke-Cun Zhang, Shao-Jian Qu
Publication date: 19 September 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.12.034
global optimizationconvergencenumerical experimentsbranch and boundnon-convex optimizationinterval Newton method
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
Global optimization algorithm for sum of generalized polynomial ratios problem, Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, On solving the sum-of-ratios problem, A practicable contraction approach for the sum of the generalized polynomial ratios problem, A global optimization algorithm for sum of quadratic ratios problem with coefficients, Global minimization for generalized polynomial fractional program, Range division and compression algorithm for quadratically constrained sum of quadratic ratios, Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem, Solving the sum-of-ratios problems by a harmony search algorithm, Global optimization for sum of geometric fractional functions, Solving sum of quadratic ratios fractional programs via monotonic function, A parametric solution method for a generalized fractional programming problem
Uses Software
Cites Work
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- On the global optimization of sums of linear fractional functions over a convex set
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Rigorous global search: continuous problems
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Solving the sum-of-ratios problem by an interior-point method
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- Fractional programming with absolute-value functions
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Global optimization for sum of linear ratios problem with coefficients
- Conic Approximations and Collinear Scalings for Optimizers
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Parametric approaches to fractional programs
- Maximization of the ratio of two convex quadratic functions over a polytope
- A conic trust-region method for nonlinearly constrained optimization
- Global optimization algorithm for the nonlinear sum of ratios problem
