Skip to main content
Log in

Piecewise linear bounding functions in univariate global optimization

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The paper addresses the problem of constructing lower and upper estimators for univariate functions. This problem is of crucial importance in global optimization, where such bounds are used to reduce the search area. We propose to use piecewise linear estimators for bounding univariate functions and show how such estimators can be derived from the function’s algebraic expression. The basic properties of such estimators are formulated and proved. We implemented the algorithms for the automated construction of lower and upper piecewise linear estimators and experimentally compared the proposed approach with the first-order interval bounds, Pijavskij method, and slope arithmetic. Numerical examples demonstrate that the piecewise linear estimators are more accurate with respect to the mentioned approaches. We also show that global optimization algorithms can significantly benefit from using piecewise linear estimators. Another advantage of the proposed approach is that the objective function does not have to be differentiable. This feature can favorably distinguish this method from other methods where the first and second derivatives are used.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Bompadre A, Mitsos A (2012) Convergence rate of Mc-Cormick relaxations. J Global Optim 52(1):1–28

    Article  MathSciNet  MATH  Google Scholar 

  • Casado LG, MartÍnez JA, GarcÍa I, Sergeyev YD (2003) New interval analysis support functions using gradient information in a global minimization algorithm. J Global Optim 25(4):345–362

    Article  MathSciNet  MATH  Google Scholar 

  • Craven BD (1988) Fractional programming, vol 4. Heldermann, Berlin

    MATH  Google Scholar 

  • Croxton KL, Gendorn B, Magnanti TL (2003) A comparison of mixed-integer models for nonconvex piecewise linear cost minimization problems. Manag Sci 49(9):1268–1273

    Article  MATH  Google Scholar 

  • Ershov A, Khamisov OV (2004) Automatic global optimization. Diskretnyi Analiz i Issledovanie Operatsii 11(2):45–68

    MathSciNet  Google Scholar 

  • Evtushenko YG (1971) A numerical method of search for the global extremum of functions (scan on a nonuniform grid). Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki 11(6):1390–1403

    Google Scholar 

  • Evtushenko Y, Posypkin M (2013) A deterministic approach to global box-constrained optimization. Optim Lett 7(4):819–829

    Article  MathSciNet  MATH  Google Scholar 

  • Floudas C, Gounaris C (2009) A review of recent advances in global optimization. J Global Optim 45(1):3–38

    Article  MathSciNet  MATH  Google Scholar 

  • Fülöp J (1985) Minimizing a separable piecewise linear continuous function subject to convex constraints of the same type by concave minimizition. Z Angew Math Mech 65(5):310–311

    MathSciNet  Google Scholar 

  • Gaudioso M, Giallombardo G, Miglionico G, Bagirov AM (2018) Minimizing nonsmooth dc functions via successive DC piecewise-affine approximations. J Global Optim 71(1):37–55

    Article  MathSciNet  MATH  Google Scholar 

  • Hansen E, Walster GW (2003) Global optimization using interval analysis: revised and expanded. CRC Press, Boca Raton

    Google Scholar 

  • Kearfott RB (1996) Rigorous global search: continuous problems. Kluwer Academic Publishers, Dordrecht

    Book  MATH  Google Scholar 

  • Keha A, de Farias J, Nemhauser G (2004) Models for representing piecewise linear cost functions. Oper Res Lett 32(1):44–48

    Article  MathSciNet  MATH  Google Scholar 

  • Khajavirad A, Sahinidis N (2012) Convex envelopes of products of convex and component-wise concave functions. J Global Optim 52(3):3911–409

    Article  MathSciNet  MATH  Google Scholar 

  • Khamisov O (2016) Explicit univariate global optimization with piecewise linear support functions. In: Proceedings of DOOR , CEUR-WS.org, vol 1623, pp 218–255. http://ceur-ws.org/Vol-1623/papermp19.pdf

  • Khamisov O (2016) Optimization with quadratic support functions in nonconvex smooth optimization. AIP Conf Proc 1776:050010. https://doi.org/10.1063/1.4965331

    Article  Google Scholar 

  • Khamisov O, Posypkin M, Usov A (2019) Piecewise linear bounding functions for univariate global optimization. In: Evtushenko Y, Jaćimović M, Khachay M, Kochetov Y, Malkova V, Posypkin M (eds) Optimization and applications. Springer, Cham, pp 170–185

    Chapter  Google Scholar 

  • Kripfganz ARS (1987) Piecewise affine functions as a difference of two convex functions. Optimization 18(1):23–29

    Article  MathSciNet  MATH  Google Scholar 

  • Kvasov DE, Sergeyev YD (2012) Univariate geometric Lipschitz global optimization algorithms. Numer Algebra Control Optim 2(1):69–90

    Article  MathSciNet  MATH  Google Scholar 

  • Mangasarian O, Rosen J, Thompson M (2005) Global minimization via piecewise-linear underestimation. J Global Optim 32(1):1–9

    Article  MathSciNet  MATH  Google Scholar 

  • Markovitz HM, Manne AS (1957) On the solution of discrete programming problems. Econometrica 25(1):84–110

    Article  MathSciNet  Google Scholar 

  • Martinez N, Anahideh H, Rosenberger JM, Martinez D, Chen VC, Wang BP (2017) Global optimization of non-convex piecewise linear regression splines. J Global Optim 68(3):563–586

    Article  MathSciNet  MATH  Google Scholar 

  • Moore RE (1966) Interval analysis, vol 4. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Ngueveu SU (2019) Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods. Eur J Oper Res 275(3):1058–1071

    Article  MathSciNet  MATH  Google Scholar 

  • Pardalos PM, Rosen J (1988) Reduction of nonlinear integer separable programming problems. Int J Comput Math 24(1):55–64

    Article  MATH  Google Scholar 

  • Pijavskij S (1967) An algorithm for finding the global extremum of function. Optim Decis 2:13–24

    Google Scholar 

  • Ratz D (1996) An optimized interval slope arithmetic and its application. Institute of Applied Mathematics, Karlsruhe

    Google Scholar 

  • Ratz D (1999) A nonsmooth global optimization technique using slopes: the one-dimensional case. J Global Optim 14(4):365–393

    Article  MathSciNet  MATH  Google Scholar 

  • Rebennack S, Kallarath J (2015) Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems. J Optim Theory Appl 167(2):617–643

    Article  MathSciNet  MATH  Google Scholar 

  • Rosen JB, Pardalos PM (1986) Global minimization of large-scale constrained concave quadratic problems by separable programming. Math Program 34(2):163–174

    Article  MathSciNet  MATH  Google Scholar 

  • Sergeyev YD (1995) A one-dimensional deterministic global minimization algorithm. Comput Math Math Phys 35(5):553–562

    MathSciNet  Google Scholar 

  • Sergeyev YD, Mukhametzhanov MS, Kvasov DE, Lera D (2016) Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization. J Optim Theory Appl 171(1):186–208

    Article  MathSciNet  MATH  Google Scholar 

  • Shary S (2016) Finite-dimensional interval analysis. Institute of Compunational Technologies, SB RAS, Novosibirsk

    MATH  Google Scholar 

  • Shubert BO (1972) A sequential method seeking the global maximum of a function. SIAM J Numer Anal 9(3):379–388

    Article  MathSciNet  MATH  Google Scholar 

  • Stancu-Minasian IM (2012) Fractional programming: theory, methods and applications, vol 409. Springer, Berlin

    MATH  Google Scholar 

  • Tuy H (1998) Convex analysis and global optimization. Kluwer Academic Publishers, Boston

    Book  MATH  Google Scholar 

  • Vielma JP, Nemhauser GL (2011) Modelling disjunctive constraints with a logarithmic number of binary variables and constraints. Math Program 128(1–2):49–72

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang H, Wang S (2008) Linearly constrained global optimization via piecewise-linear approximation. J Comput Appl Math 214:11–120

    MathSciNet  Google Scholar 

Download references

Funding

This study was funded by Russian Fund for Basic Research (Grants Nos. 19-01-00666, 18-07-01432).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mikhail Posypkin.

Ethics declarations

Conflict of interest

Oleg Khamisov, Mikhail Posypkin and Alexander Usov declare that they have no conflict of interest.

Human and animals rights

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by Yaroslav D. Sergeyev.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Posypkin, M., Usov, A. & Khamisov, O. Piecewise linear bounding functions in univariate global optimization. Soft Comput 24, 17631–17647 (2020). https://doi.org/10.1007/s00500-020-05254-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05254-3

Keywords

Navigation