IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v77y2020i2d10.1007_s10898-019-00870-2.html

Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds

Author

Listed:
  • Yong Xia

    (Beihang University)

  • Longfei Wang

    (Henan University)

  • Xiaohui Wang

    (Beihang University)

Abstract

We consider the problem of minimizing the sum of a convex–concave function and a convex function over a convex set (SFC). It can be reformulated as a univariate minimization problem, where the objective function is evaluated by solving convex optimization. The optimal Lagrangian multipliers of the convex subproblems are used to construct sawtooth curve lower bounds, which play a key role in developing the branch-and-bound algorithm for globally solving (SFC). In this paper, we improve the existing sawtooth-curve bounds to new wave-curve bounds, which are used to develop a more efficient branch-and-bound algorithm. Moreover, we can show that the new algorithm finds an $$\epsilon $$ϵ-approximate optimal solution in at most $$O\left( \frac{1}{\epsilon }\right) $$O1ϵ iterations. Numerical results demonstrate the efficiency of our algorithm.

Suggested Citation

  • Yong Xia & Longfei Wang & Xiaohui Wang, 2020. "Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds," Journal of Global Optimization, Springer, vol. 77(2), pages 301-318, June.
    • Handle: RePEc:spr:jglopt:v:77:y:2020:i:2:d:10.1007_s10898-019-00870-2
    DOI: 10.1007/s10898-019-00870-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00870-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00870-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Siegfried Schaible, 1976. "Duality in Fractional Programming: A Unified Approach," Operations Research, INFORMS, vol. 24(3), pages 452-461, June.
    2. Frenk, J.B.G. & Schaible, S., 2004. "Fractional Programming," ERIM Report Series Research in Management ERS-2004-074-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    3. Siegfried Schaible, 1976. "Fractional Programming. I, Duality," Management Science, INFORMS, vol. 22(8), pages 858-867, April.
    4. Lei-Hong Zhang, 2013. "On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere," Computational Optimization and Applications, Springer, vol. 54(1), pages 111-139, January.
    5. Frenk, J.B.G. & Schaible, S., 2004. "Fractional Programming," Econometric Institute Research Papers ERS-2004-074-LIS, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Werner Dinkelbach, 1967. "On Nonlinear Fractional Programming," Management Science, INFORMS, vol. 13(7), pages 492-498, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Huang, Bingdi & Shen, Peiping, 2024. "An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. A. Lejeune & H. N. Nguyen, 2026. "Distributionally robust fractional optimization of probability of exceedance," Journal of Global Optimization, Springer, vol. 94(1), pages 127-174, January.
    2. Smail Addoune & Karima Boufi & Ahmed Roubi, 2018. "Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 212-239, October.
    3. Benson, Harold P., 2006. "Fractional programming with convex quadratic forms and functions," European Journal of Operational Research, Elsevier, vol. 173(2), pages 351-369, September.
    4. S. K. Mishra & D. Singh & B. C. Joshi & Pankaj Kumar, 2026. "On the Optimality and Duality in Nonsmooth Multiobjective Fractional Optimization Problems via Higher-Order E-Convexity," SN Operations Research Forum, Springer, vol. 7(1), pages 1-17, March.
    5. Chimaa Ennouri & Karima Boufi & Ahmed Roubi, 2026. "Block Coordinate Dinkelbach Algorithms for Solving Block-Structured Constrained Fractional Optimization Problems," SN Operations Research Forum, Springer, vol. 7(1), pages 1-21, March.
    6. Maziar Sahamkhadam & Andreas Stephan, 2023. "Portfolio optimization based on forecasting models using vine copulas: An empirical assessment for global financial crises," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 42(8), pages 2139-2166, December.
    7. Yong Xia & Longfei Wang & Meijia Yang, 2019. "A fast algorithm for globally solving Tikhonov regularized total least squares problem," Journal of Global Optimization, Springer, vol. 73(2), pages 311-330, February.
    8. Xiaojun Lei & Zhian Liang, 2008. "Study on the Duality between MFP and ACP," Modern Applied Science, Canadian Center of Science and Education, vol. 2(6), pages 1-81, November.
    9. C. Singh & M.A. Hanson, 1991. "Multiobjective fractional programming duality theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(6), pages 925-933, December.
    10. Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2022. "An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 830-855, March.
    11. Wong, Man Hong, 2013. "Investment models based on clustered scenario trees," European Journal of Operational Research, Elsevier, vol. 227(2), pages 314-324.
    12. João Costa & Maria Alves, 2013. "Enhancing computations of nondominated solutions in MOLFP via reference points," Journal of Global Optimization, Springer, vol. 57(3), pages 617-631, November.
    13. Frauke Liers & Lars Schewe & Johannes Thürauf, 2022. "Radius of Robust Feasibility for Mixed-Integer Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 243-261, January.
    14. Giacomo Cristinelli & José A. Iglesias & Daniel Walter, 2026. "Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach," Computational Optimization and Applications, Springer, vol. 93(1), pages 209-265, January.
    15. H. Boualam & A. Roubi, 2019. "Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs," Journal of Global Optimization, Springer, vol. 74(2), pages 255-284, June.
    16. Nuran Güzel, 2013. "A Proposal to the Solution of Multiobjective Linear Fractional Programming Problem," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    17. T Peña & P Lara & C Castrodeza, 2009. "Multiobjective stochastic programming for feed formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1738-1748, December.
    18. Denoyel, Victoire & Alfandari, Laurent & Thiele, Aurélie, 2017. "Optimizing healthcare network design under reference pricing and parameter uncertainty," European Journal of Operational Research, Elsevier, vol. 263(3), pages 996-1006.
    19. Oleksii Ursulenko & Sergiy Butenko & Oleg Prokopyev, 2013. "A global optimization algorithm for solving the minimum multiple ratio spanning tree problem," Journal of Global Optimization, Springer, vol. 56(3), pages 1029-1043, July.
    20. Paula Alexandra Amaral & Immanuel M. Bomze, 2019. "Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations," Journal of Global Optimization, Springer, vol. 75(2), pages 227-245, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:77:y:2020:i:2:d:10.1007_s10898-019-00870-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.