Skip to main content
SpringerLink
Log in

Semi-infinite Programming: Numerical Methods

SIP

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Exchange Methods

Discretization Methods

Reduction Methods

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

References

  1. Blum E, Oettli W (1975) Mathematische Optimierung. Grundlagen und Verfahren. Springer, Berlin

    MATH  Google Scholar 

  2. Conn AR, Gould NIM (1987) An exact penalty function for semi-infinite programming. Math Program 37:19–40

    Article  MathSciNet  MATH  Google Scholar 

  3. Coope ID, Watson GA (1985) A projected Lagrangian algorithm for semi-infinite programming. Math Program 32:337–356

    Article  MathSciNet  MATH  Google Scholar 

  4. Fang S-Z, Lin C-J, Wu S-Y (1994) On solving convex quadratic semi-infinite programming problems. Optim 31:107–125

    Article  MathSciNet  MATH  Google Scholar 

  5. Fang S-Z, Tsao H-SJ (1996) An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints. J Comput Appl Math 72:127–139

    Article  MathSciNet  MATH  Google Scholar 

  6. Fiacco AV, Kortanek K (eds), (1983) Semi-infinite programming and applications. Springer, Berlin

    MATH  Google Scholar 

  7. Gonzaga C, Polak E, Trahan R (1980) An improved algorithm for optimization problems with functional inequality constraints. IEEE Trans Autom Control 25:49–54

    Article  MathSciNet  MATH  Google Scholar 

  8. Görner St (1997) Ein Hybridverfahren zur Lösung nichtlinearer semi-infiniter Optimierungsaufgaben. PhD Thesis, Techn Univ Berlin, Berlin

    Google Scholar 

  9. Gramlich G, Hettich R, Sachs E (1995) SQP-methods in semi-infinite programming. SIAM J Optim 5:641–658

    Article  MathSciNet  MATH  Google Scholar 

  10. Gustafson SA (1983) A three-phase algorithm for semi-infinite programming problems. In: Fiacco AV, Kortanek KO (eds) Semi-infinite Programming and Applications. Lecture Notes Economics and Math Systems. Springer, Berlin, pp 138–157

    Google Scholar 

  11. Gustafson SA, Kortanek KO (1973) Numerical solution of a class of semi-infinite programming problems. Naval Res Logist Quart 20:477–504

    Article  MathSciNet  MATH  Google Scholar 

  12. Gustafson SA, Kortanek KO (1983) Semi-infinite programming and applications. In: Bachem A, Grötschel M, Korte B (eds) Mathematical Programming: The State of the Art. Springer, Berlin, pp 132–157

    Google Scholar 

  13. Han SP (1977) A globally convergent method for nonlinear programming. J Optim Th Appl 22:297–309

    Article  MATH  Google Scholar 

  14. Hettich R (1983) A review of numerical methods for semi-infinite optimization. In: Fiacco AV, Kortanek KO (eds) Semi-infinite Programming and Applications. Lecture Notes Economics and Math Systems. Springer, Berlin, pp 158–178

    Google Scholar 

  15. Hettich R, Gramlich G (1990) A note on an implementation of a method for quadratic semi-infinite programs. Math Program 46:249–254

    Article  MathSciNet  MATH  Google Scholar 

  16. Hettich R, Honstede W van (1979) On quadratically convergent methods for semi-infinite programming. In: Hettich R (ed) Semi-infinite Programming. Lecture Notes Control Inform Sci. Springer, Berlin, pp 97–111

    Chapter  Google Scholar 

  17. Hettich R, Jongen HTh (1978) Semi-infinite programming: Conditions of optimality and applications. In: Lecture Notes Control Inform Sci, vol 7, pp 1–11

    Google Scholar 

  18. Hettich R, Kortanek KO (1993) Semi-infinite programming: Theory, methods and applications. SIAM Rev 35:380–429

    Article  MathSciNet  MATH  Google Scholar 

  19. Hettich R, Zencke P (1982) Numerische Methoden der Approximation und semi-infiniten Optimierung. Studienbücher Math. Teubner, Leipzig

    MATH  Google Scholar 

  20. Jongen HTh, Jonker P, Twilt F (1986) Critical sets in parametric optimization. Math Program 34:333–353

    Article  MathSciNet  MATH  Google Scholar 

  21. Kaplan A, Tichatschke R (1992) A regularized penalty method for solving convex semi-infinite programs. Optim 26:215–228

    Article  MathSciNet  MATH  Google Scholar 

  22. Kaplan A, Tichatschke R (1996) Path-following proximal approach for solving ill-posed convex semi-infinite programming problems. J Optim Th Appl 90:113–137

    Article  MathSciNet  MATH  Google Scholar 

  23. Kortanek KO, No H (1993) A central cutting plane algorithm for convex semi-infinite programs. SIAM J Optim 3:901–918

    Article  MathSciNet  MATH  Google Scholar 

  24. Krabs W (1975) Optimierung und Approximation. Studienbücher Math. Teubner, Leipzig

    MATH  Google Scholar 

  25. Lawrence CT, Tits AL (1997) Feasible sequential quadratic programming for finely discretized problems from SIP. In: Rückmann J, Reemtsen R (eds) Semi-Infinite Programming. Kluwer, Dordrecht, pp 159–193

    Google Scholar 

  26. Painer ER, Tits AL (1989) A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design. IEEE Trans Autom Control 39:903–908

    Article  Google Scholar 

  27. Polak E (1987) On the mathematical fundations of nondifferentiable optimization in engineering design. SIAM Rev 29:21–89

    Article  MathSciNet  Google Scholar 

  28. Polak E, He L (1992) Rate preserving discretization strategies for semi-infinite programming and optimal control. SIAM J Control Optim 30:548–572

    Article  MathSciNet  MATH  Google Scholar 

  29. Polak E, Tits AL (1982) A recursive quadratic programming algorithm for semi-infinite programs. J Appl Math Optim 8:325–349

    Article  MathSciNet  MATH  Google Scholar 

  30. Potchinkov A, Reemtsen R (1995) The design of FIR-filters in the complex plane by convex optimization. Signal Processing 46:127–146

    Article  MATH  Google Scholar 

  31. Reemtsen R (1992) A cutting plane method for solving minimax problems. Numer Algorithms 2:409–436

    Article  MathSciNet  MATH  Google Scholar 

  32. Reemtsen R (1994) Some outer approximation methods for semi-infinite optimization problems. J Comput Appl Math 53:87–108

    Article  MathSciNet  MATH  Google Scholar 

  33. Reemtsen R, Rückmann J-J (eds) (1998) Semi-infinite programming. Kluwer, Dordrecht

    MATH  Google Scholar 

  34. Schättler U (1996) An interior-point method for solving semi-infinite programming problems. Ann Oper Res 62:277–301

    Article  MathSciNet  MATH  Google Scholar 

  35. Sonnevend G (1990) Applications of analytic centers for the numerical solution of semi-infinite, convex programs arising in control theory. In: Lecture Notes Control Inform Sci, vol 143, pp 413–422

    Google Scholar 

  36. Sonnevend G (1994) A new class of a high order interior point methods for the solution of convex semi-infinite optimization problems. In: Bulirsch R, Kraft D (eds) Computational and optimal control. Birkhäuser, Basel, pp 193–211

    Google Scholar 

  37. Tanaka Y, Fukushima M, Hasegawa T (1987) Implementable L-infinity penalty function-method for semi-infinite optimization. Internat J Syst Sci 18:1563–1568

    Article  MathSciNet  MATH  Google Scholar 

  38. Tanaka Y, Fukushima M, Ibaraki T (1988) A globally convergent SQP-method for semi-infinite optimization. J Comput Appl Math 23:141–153

    Article  MathSciNet  MATH  Google Scholar 

  39. Tichatschke R (1985) Semi-infinite programming problems. Math Control Th, Banach Center Publ 14:543–554

    MathSciNet  Google Scholar 

  40. Tichatschke R, Lohse Th (1982) Eine verallgemeinerte Schnittmethode für konvexe semi-infinite Optimierungsaufgaben. Wiss Z Techn Hochsch Karl-Marx-Stadt 24:332–338

    MathSciNet  MATH  Google Scholar 

  41. Tichatschke R, Nebeling V (1988) A cutting- plane algorithm for quadratic semi-infinite programming problems. Optim 19:803–817

    Article  MathSciNet  MATH  Google Scholar 

  42. Watson GA (1981) Globally convergent methods for semi-infinite programming problems. BIT 21:362–373

    Article  MathSciNet  MATH  Google Scholar 

  43. Zhou JL, Tits AL (1996) An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM J Optim 6:461–487

    Article  MathSciNet  MATH  Google Scholar 

  44. Zwier G (1987) Structural analysis in semi-infinite programming. PhD Thesis, Twente Univ, Enschede

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Trier, Trier, Germany

    Rainer Hettich, Alexander Kaplan & Rainer Tichatschke

Authors
  1. Rainer Hettich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Kaplan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rainer Tichatschke
    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

Hettich, R., Kaplan, A., Tichatschke, R. (2008). Semi-infinite Programming: Numerical Methods . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_588

Download citation

Publish with us

Policies and ethics

Search

Navigation