Skip to main content
SpringerLink
Log in
Book cover

Symbolic Algebraic Methods and Verification Methods pp 117–127Cite as

Quasi Convex-Concave Extensions

  • Conference paper

Abstract

Convexity and its generalizations have been considered in many publications during the last decades. In this paper we discuss the problem of bounding functions from below by quasiconvex functions and from above by quasiconcave functions. Moreover, applications für nonlinear systems and constrained global optimization problems are considered briefly.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Al-Khayyal, F.A., Falk, J.E. (1983): Jointly Constrained Bieonvex Programming. Math. Oper. Res. 8(2):273–286

    Article  MathSciNet  MATH  Google Scholar 

  • Alefeld, G., Herzberger, J. (1983): Introduction to Interval Computations. Academic Press, New York

    MATH  Google Scholar 

  • Avriel, M. (1976): Nonlinear Programming: Analysis and Methods. Prentice-Hall, Inc., New Jersey

    MATH  Google Scholar 

  • Avriel, M., Diewert, W.W., Schaible, S., Zang, I. (1988): Generalized Concavity. Plenum Press, New York

    Book  MATH  Google Scholar 

  • Bulatov, V.P. (1977): Embedding Methods in Optimization Problems. Nauka, Novosibirsk (in Russian)

    Google Scholar 

  • Bulatov, V.P., Kasinkaya, L.I. (1982): Some Methods of Concave Minimization and Their Applications. In: Methods of Optimization and Their Applications. Nauka, Novosibirsk, pp. 71–80

    Google Scholar 

  • Cambini, A., Castagnoli, E., Martein, L., Mazzoleni, P., Schaible, S. (1989): Generalized Convexity and Fractional Programming with Economic Applications. Lecture Notes in Economics and Mathematical Systems, No. 345. Springer-Verlag, Berlin

    Google Scholar 

  • Dallwig, S., Neumaier, A., Schichl, H. (1997): GLOPT-a program for constrained global optimization. In: I.M. Bomze et al. (eds.): Developments in global optimization. Kluwer Academic Publishers, pp. 1936

    Google Scholar 

  • Emelichev, V.A., Kovalev, M.M. (1970): Solving Certain Concave Programming Problems by Successive Approximation I. Izvetya Akademii Nauka Bssr 6:27–34

    Google Scholar 

  • Falk, J.E., Hoffmann, K.L. (1976): A Successive Underestimation Method for Concave Minimization Problems. Math. Oper. Res. 1:251–259

    Article  MATH  Google Scholar 

  • Falk, J.E., Soland, R.M. (1969): An Algorithm for Separable Nonconvex Programming Problems. Management Science 15:550–569

    Article  MathSciNet  MATH  Google Scholar 

  • Griewank, A., Corliss, G.F. (1991): Automatic Differentiation of Algorithms. Theory, Implementation, and Applications. SIAM, Philadelphia

    Google Scholar 

  • Hansen, E.R (1992): Global Optimization using Interval Analysis. Marcel Dekker, New York

    MATH  Google Scholar 

  • Horst, R. (1976): An Algorithm for Nonconvex Programming Problems. Mathematical Programming 10:312–321

    Article  MathSciNet  MATH  Google Scholar 

  • Jansson, C. (1999a): Convex Relaxations for Global Constrained Optimization Problems. In: Keil, F., Mackens, W., Voss, H. (eds.): Scientific Computing in Chemical Engineering II. Springer Verlag, Berlin, pp. 322–329

    Google Scholar 

  • Jansson, C. (1999b): Quasiconvex Relaxations Based on Interval Arithmetic. Technical report 99.4, Inst. f. Informatik IU, TU Hamburg-Harburg

    Google Scholar 

  • Jansson, C. (2000): Convex-Concave Extensions. BIT 40(2):291–313

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  • Krawczyk, R., Neumaier, A. (1985): Interval Slopes for Rational Functions and Associated Centered Forms. SIAM J. Numer. Anal. 22(3):604–616

    Article  MathSciNet  MATH  Google Scholar 

  • Moore, R.E. (1979): Methods and Applications of Interval Analysis. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  • Neumaier, A. (1990): Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications. Cambridge University Press

    Google Scholar 

  • Neumaier, A. (1997): NOP-a compact input format for nonlinear optimization problems. In: I.M. Bomze et al. (eds.): Developments in global optimization. Kluwer Academic Publishers, pp. 1–18

    Google Scholar 

  • Ratschek, H., Rokne, J. (1984): Computer Methods for the Range of Functions. Halsted Press (Ellis Horwood Limited), New York (Chichester)

    MATH  Google Scholar 

  • Ratschek, H., Rokne, J. (1988): New Computer Methods for Global Optimization. John Wiley & Sons (Ellis Horwood Limited), New York (Chichester)

    MATH  Google Scholar 

  • Rump, S.M. (1996): Expansion and Estimation of the Range of Nonlinear Functions. Mathematics of Computation 65(216):1503–1512

    Article  MathSciNet  MATH  Google Scholar 

  • Rump, S.M. (1999): INTLAB-INTerval LABoratory. In: Tibor Csendes (ed.): Developements in Reliable Computing. Kluwer Academic Publishers, pp. 77–104

    Google Scholar 

  • Schaible, S. (1972): Quasi-convex Optimization in General Real Linear Spaces. Zeitschrift für Operations Research 16:205–213

    MathSciNet  MATH  Google Scholar 

  • Schaible, S. (1981): Quasiconvex, Pseudoconvex, and Strictly Pseudoconvex Quadratic Functions. Journal of Optimization Theory and Applications 35(3): 303–338

    Article  MathSciNet  MATH  Google Scholar 

  • Schnepper, C.A., Stadtherr, M.A. (1993): Application of a ParallelInterval Newton/Generalized Bisection Algorithm to Equation-Based Chemical Process Flowsheeting. Interval Computations 4:40–64

    MathSciNet  Google Scholar 

  • Van Hentenryck, P., Michel, P., Deville, Y. (1997): Numerica: A Modelling Language for Global Optimization. MIT Press Cambridge

    Google Scholar 

  • Zamora, J.M., Grossmann, I.E. (1998): Continuous Global Optimization of Structured Process Systems Models. Computers Chem. Engineering 22(12):1749–1770

    Article  Google Scholar 

Download references

Authors
  1. Christian Jansson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut fûr Angewandte Mathematik, Universitüt Karlsruhe, Deutschland

    Götz Alefeld

  2. Mathematisch-Physikalische Fakultüt, Universitüt Karlovy, Prag, Tschechien, Czech Republic

    Jiří Rohn

  3. Technische Informatik III, Technische Universitüt Hamburg, Deutschland

    Siegfried Rump

  4. Department of Mathematical Science, Ehime University, Matsuyama, Japan

    Tetsuro Yamamoto

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Wien

About this paper

Cite this paper

Jansson, C. (2001). Quasi Convex-Concave Extensions. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds) Symbolic Algebraic Methods and Verification Methods. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6280-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6280-4_12

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83593-7

  • Online ISBN: 978-3-7091-6280-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation