Skip to main content
SpringerLink
Log in

Towards Optimal Techniques for Solving Global Optimization Problems: Symmetry-Based Approach

  • Chapter
Models and Algorithms for Global Optimization

Part of the book series: Optimization and Its Applications ((SOIA,volume 4))

Abstract

In many practical situations, we have several possible actions, and we must choose the best action. For example, we must find the best design of an object, or the best control of a plant. The set of possible actions is usually characterized by parameters x = (x 1, ..., x n), and the result of different actions (controls) is characterized by an objective function f(x).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adjiman, C.S., Androulakis, I., Floudas, C.A.: A global optimization method, αBB, for general twice-differentiable constrained NLP II. Implementation and computational results. Computers and Chemical Engineering, 22, 1159–1179 (1998)

    Article  Google Scholar 

  2. Adjiman, C.S., Dallwig, S., Androulakis, I., Floudas, C.A.: A global optimization method, αBB, for general twice-differentiable constrained NLP I. Theoretical aspects. Computers and Chemical Engineering, 22, 1137–1158 (1998)

    Article  Google Scholar 

  3. Akrotirianakis, I.G., Floudas, C.A.: Computational experience with a new class of convex underestimators: box-constrained NLP problems. Journal of Global Optimization, 29, 249–264 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Akrotirianakis, I.G., Floudas, C.A. A new class of improved convex un derestimators for twice continuously differentiable constrained NLPs. Journal of Global Optimization, to appear

    Google Scholar 

  5. Casado, L.G., García, I.: New load balancing criterion for parallel interval global optimization algorithm, In: Proc. of the 16th IASTED International Conference, Garmisch-Partenkirchen, Germany, February 1998, 321–323 (1998)

    Google Scholar 

  6. Casado, L.G., García, I., Csendes, T.: A new multisection technique in interval methods for global optimization. Computing, 65, 263–269 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Floudas, C.A.: Deterministic Global Optimization: Theory, Methods, and Applications. Kluwer, Dordrecht (2000)

    Google Scholar 

  8. Horst, R., Pardalos, P.M. (eds): Handbook of Global Optimization. Kluwer, Dordrecht (1995)

    MATH  Google Scholar 

  9. Iourinski, D., Starks, S.A., Kreinovich, V., Smith, S.F.: Swarm intelligence: theoretical proof that empirical techniques are optimal. In: Proceedings of the 2002 World Automation Congress WAC’2002, Orlando, Florida, June 9–13, 107–112 (2002)

    Google Scholar 

  10. Kreinovich, V., Csendes, T.: Theoretical justification of a heuristic sub-box selection criterion. Central European Journal of Operations Research, 9, 255–265 (2001)

    MATH  MathSciNet  Google Scholar 

  11. Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht (1996)

    MATH  Google Scholar 

  12. Kennedy, J., Eberhart, R., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, San Francisco, California (2001)

    Google Scholar 

  13. Kearfott, R.B., Kreinovich, V.: Where to bisect a box? A theoretical explanation of the experimental results. In: Alefeld, G., Trejo, R.A. (eds) Interval Computations and its Applications to Reasoning Under Uncertainty, Knowledge Representation, and Control Theory. Proceedings of MEXICON’98, Workshop on Interval Computations, 4th World Congress on Expert Systems, México City, México (1998)

    Google Scholar 

  14. Kearfott, R.B., Kreinovich, V.: Beyond convex? Global optimization is feasible only for convex objective functions: a theorem. Journal of Global Optimization, 33, 617–624 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kreinovich, V., Starks, S.A., Mayer, G.: On a theoretical justification of the choice of epsilon-inflation in PASCAL-XSC. Reliable Computing, 3, 437–452 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Maranas, C.D., Floudas, C.A.: Global minimal potential energy conformations for small molecules. Journal of Global Optimization, 4, 135–170 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  17. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin (1996)

    MATH  Google Scholar 

  18. Nguyen, H.T., Kreinovich, V. Applications of Continuous Mathematics to Computer Science. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  19. Pinter, J.D.: Global Optimization in Action. Kluwer, Dordrecht (1996)

    MATH  Google Scholar 

  20. Ratz, D.: Automatische Ergebnisverifikation bei globalen Optimierungs-problemen. Ph.D. dissertation, Universität Karlsruhe (1992)

    Google Scholar 

  21. Ratz, D.: Box-splitting strategies for the interval Gauss-Seidel step in a global optimization method. Computing, 53, 337–354 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  22. Rump, S.M.: Kleine Fehlerschranken bei Matrixproblemen. Ph.D. dissertation, Universität Karlsruhe (1980)

    Google Scholar 

  23. Rump, S.M.: On the solution of interval linear systems. Computing, 47, 337–353 (1992)

    Article  MathSciNet  Google Scholar 

  24. Rump, S.M.: A note on epsilon-inflation. Reliable Computing, 4(4), 371–375 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  25. Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer, Dordrecht (2002)

    MATH  Google Scholar 

  26. Vavasis, S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, New York (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Christodoulos A. Floudas

  2. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79968, USA

    Vladik Kreinovich

Authors
  1. Christodoulos A. Floudas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladik Kreinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ã…bo Akademi University, Ã…bo, Finland

    Aimo Törn

  2. Institute of Mathematics and Informatics, Vilnius, Lithuania

    Julius Žilinskas

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Floudas, C.A., Kreinovich, V. (2007). Towards Optimal Techniques for Solving Global Optimization Problems: Symmetry-Based Approach. In: Törn, A., Žilinskas, J. (eds) Models and Algorithms for Global Optimization. Optimization and Its Applications, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36721-7_2

Download citation

Publish with us

Policies and ethics

Search

Navigation