Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region

DOI10.1007/s12190-012-0602-8zbMath1295.90057OpenAlexW2041570321MaRDI QIDQ2511139

De-Tong Zhu, Yong Gang Pei

Publication date: 5 August 2014

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-012-0602-8

zbMATH Keywords

difference of convex functionsglobal optimizationbranch and boundsum of ratios

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (9)

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 ⋮ 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 ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ Global optimization for a class of nonlinear sum of ratios problem ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations

Cites Work

• Unnamed Item
• Unnamed Item
• Using concave envelopes to globally solve the 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
• Fractional programming - a survey
• Conical partition algorithm for maximizing the sum of dc ratios
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• A note on the sum of a linear and linear-fractional function
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Cluster Analysis and Mathematical Programming
• Introduction to global optimization.
• Maximization of the ratio of two convex quadratic functions over a polytope

This page was built for publication: Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region