Skip to main content

On Regularity and Optimality in Nonlinear Semi-Infinite Programming

  • Chapter
Semi-Infinite Programming

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 57))

Abstract

This paper deals with semi-infinite convex optimization problems. In particular, a regularity condition introduced recently by Guerra and Jimenez for the lin ear case is extended to the convex case, employing a suitable generalization of Haar’s condition. The convergence of an exchange process under such Haar-like conditions is investigated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.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. A. Ben-Tal, E. Rosinger and A. Ben-Israel. A Helly-Type Theorem and Semi-infinite Programming. In: C.V. Coffman and G.J. Fix, editors, Con structive Approches to Mathematical Models, pages 127–135, Academic Press, 1979.

    Google Scholar 

  2. E. Blum, W. Oettli. Mathematische Optimierung, Springer-Verlag, 1975.

    Book  MATH  Google Scholar 

  3. F. H. Clarke, Yu. S. Ledyaev and R. J. Stern. Complements, approximations, smoothings and invariance properties, Journal of Convex Analysis, 4:189–219, 1997.

    MathSciNet  MATH  Google Scholar 

  4. H. G. Eggleston. Convexity, Cambridge University Press, Cambridge, 1969.

    Google Scholar 

  5. K. Fan, I. Glicksberg and A. J. Hoffman. Systems of inequalities involv ing convex functions, Proceedings of the American Mathematical Society, 8:617–622, 1957.

    Article  MathSciNet  MATH  Google Scholar 

  6. W. Fenchel. über konvexe Funktionen mit vorgeschriebenen Niveauman nigfaltigkeiten, Mathematische Zeitschrift, 63:496–506, 1956.

    Article  MathSciNet  MATH  Google Scholar 

  7. F. Giannessi. General optimality conditions via a separation scheme. In E. Spedicato, editor, Algorithms for Continuous Optimization, Kluwer, pages 1–23, 1994.

    Chapter  Google Scholar 

  8. F. Guerra and M. A. Jimenez. On feasible sets defined through Chebyshev approximation, Mathematical Metfiods of Operations Research, 47:255–264, 1998.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Hassouni, A., Oettli, W. (2001). On Regularity and Optimality in Nonlinear Semi-Infinite Programming. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3403-4_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5204-2

  • Online ISBN: 978-1-4757-3403-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics