iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-0-387-74759-0_229
Global Optimization: Cutting Angle Method | SpringerLink
Skip to main content
Springer Nature Link
Log in

Global Optimization: Cutting Angle Method

  • Reference work entry
Encyclopedia of Optimization

  • 173 Accesses

Article Outline

Introduction

Definitions

  Notation

  Abstract Convex Functions

  IPH Functions

  Lipschitz Functions

Methods

  Generalized Cutting Plane Method

  Global Minimization of IPH Functions over Unit Simplex

  Global Minimization of Lipschitz Functions

  The Auxiliary Problem

  Solution of the Auxiliary Problem

Conclusions

References

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The norm \( ||\cdot|| \) can be replaced by any metric, or, more generally, any distance function based on Minkowski gauge. For example, a polyhedral distance \( d_P(x,y)=\max \{[(x-y), h_i]\; | 1\leq i \leq m \} \), where \( h_i \in \mathbb{R}^n, i=1,\ldots,m \) is the set of vectors that define a finite polyhedron \( P=\bigcap_{i=1}^m \{x\;|\; [x , h_i] \leq 1 \} \).

References

  1. Andramonov MY, Rubinov AM, Glover BM (1999) Cutting angle method in global optimization. Appl Math Lett 12:95–100

    Article  MathSciNet  MATH  Google Scholar 

  2. Bagirov AM, Rubinov AM (2000) Global minimization of increasing positively homogeneous functions over the unit simplex. Ann Oper Res 98:171–187

    Article  MathSciNet  MATH  Google Scholar 

  3. Bagirov AM, Rubinov AM (2001) Modified versions of the cutting angle method. In: Hadjisavvas N, Pardalos PM (eds) Advances in Convex Analysis and Global Optimization. Kluwer, Dordrecht, pp 245–268

    Google Scholar 

  4. Bagirov AM, Rubinov AM (2003) The cutting angle method and a local search. J Global Optim 27:193–213

    Article  MathSciNet  MATH  Google Scholar 

  5. Bartels SG, Kuntz L, Sholtes S (1995) Continuous selections of linear functions and nonsmooth critical point theory. Nonlinear Anal TMA 24:385–407

    Article  MATH  Google Scholar 

  6. Batten LM, Beliakov G (2002) Fast algorithm for the cutting angle method of global optimization. J Global Optim 24:149–161

    Article  MathSciNet  MATH  Google Scholar 

  7. Beliakov G (2003) Geometry and combinatorics of the cutting angle method. Optimization 52:379–394

    Article  MathSciNet  MATH  Google Scholar 

  8. Beliakov G (2004) The Cutting Angle Method – a tool for constrained global optimization. Optim Methods Softw 19:137–151

    Article  MathSciNet  MATH  Google Scholar 

  9. Beliakov G (2005) A review of applications of the Cutting Angle methods. In: Rubinov A, Jeyakumar V (eds) Continuous Optimization. Springer, New York, pp 209–248

    Chapter  Google Scholar 

  10. Beliakov G (2005) Universal nonuniform random vector generator based on acceptance-rejection. ACM Trans Modelling Comp Simulation 15:205–232

    Article  Google Scholar 

  11. Beliakov G (2006) Interpolation of Lipschitz functions. J Comp Appl Math 196:20–44

    Article  MathSciNet  MATH  Google Scholar 

  12. Beliakov G, Lim KF (2007) Challenges of continuous global optimization in molecular structure prediciton. Eur J Oper Res 181(3):1198–1213

    Article  MathSciNet  MATH  Google Scholar 

  13. Demyanov VF, Rubinov AM (1995) Constructive Nonsmooth Analysis. Peter Lang, Frankfurt am Main

    MATH  Google Scholar 

  14. Horst R, Pardalos PM, Thoai NV (1995) Introduction to Global Optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  15. Horst R, Tuy H (1996) Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin

    MATH  Google Scholar 

  16. Kelley JE (1960) The cutting-plane method for solving convex programs. J SIAM 8:703–712

    MathSciNet  Google Scholar 

  17. Lim KF, Beliakov G, Batten LM (2003) Predicting molecular structures: Application of the cutting angle method. Phys Chem Chem Phys 5:3884–3890

    Article  Google Scholar 

  18. Pallaschke D, Rolewicz S (1997) Foundations of Mathematical Optimization (Convex Analysis without Linearity). Kluwer, Dordrecht

    MATH  Google Scholar 

  19. Pinter JD (1996) Global Optimization in Action. Continuous and Lipschitz Optimization: Algorithms, Implementation and Applications. Kluwer, Dordrecht

    Google Scholar 

  20. Piyavskii SA (1972) An algorithm for finding the absolute extremum of a function. USSR Comp Math Math Phys 12:57–67

    Article  Google Scholar 

  21. Rockafellar RT (1970) Convex Analysis. Princeton University Press, Princeton

    MATH  Google Scholar 

  22. Rolewicz S (1999) Convex analysis without linearity. Control Cybernetics 23:247–256

    MathSciNet  Google Scholar 

  23. Rubinov AM (2000) Abstract Convexity and Global Optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  24. Rubinov AM, Andramonov MY (1999) Minimizing increasing star-shaped functions based on abstract convexity. J Global Optim 15:19–39

    Article  MathSciNet  MATH  Google Scholar 

  25. Rubinov AM, Andramonov MY (1999) Lipschitz programming via increasing convex-along-rays fuinctions. Optim Methods Softw 10:763–781

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  27. Singer I (1997) Abstract Convex Analysis. Wiley‐Interscience Publication, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Informatics and Applied Optimization, School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, Australia

    Adil Bagirov

  2. School of Engineering and Information Technology, Deakin University, Victoria, Australia

    Gleb Beliakov

Authors
  1. Adil Bagirov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gleb Beliakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Bagirov, A., Beliakov, G. (2008). Global Optimization: Cutting Angle Method . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_229

Download citation

Publish with us

Policies and ethics

Search

Navigation