Skip to main content
SpringerLink
Log in

Semi-infinite Programming: Discretization Methods

SIP

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Convergence of Solutions of Discretized SIP Problems

Solution of Discretized SIP Problems

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. Ašić MD, Kovačević-Vujčić VV (1988) An interior semi-infinite programming method. J Optim Th Appl 59:353–367

    Article  MATH  Google Scholar 

  2. Bertsekas DP (1996) Constrained optimization and Lagrange multiplier methods. Athena Sci, Belmont

    Google Scholar 

  3. Boggs PT, Tolle JW (1995) Sequential quadratic programming. Acta Numer 4:1–51

    Article  MathSciNet  Google Scholar 

  4. Goberna MA, López MA (1987) Reduction and discrete approximation in linear semi-infinite programming. Optim 18:643–658

    Article  MATH  Google Scholar 

  5. Goberna MA, López MA (1988) Optimal value function in semi-infinite programming. J Optim Th Appl 59:261–279

    MATH  Google Scholar 

  6. Goberna MA, López MA (1998) Linear semi-infinite optimization. Wiley, New York

    MATH  Google Scholar 

  7. Gonzaga C, Polak E (1979) On constraint dropping schemes and optimality functions for a class of outer approximations algorithms. SIAM J Control Optim 17:477–493

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Görner S (1997) Ein Hybridverfahren zur Lösung nichtlinearer semi-infiniter Optimierungsprobleme. PhD Thesis, Techn Univ Berlin, Berlin, Germany

    Google Scholar 

  10. Grigorieff R, Reemtsen R (1990) Discrete approximations of minimization problems. II Applications. Numer Funct Anal Optim 11:721–761

    Article  MathSciNet  MATH  Google Scholar 

  11. Gustafson S-A (1979) On numerical analysis in semi-infinite programming. In: Hettich R (ed) Semi-Infinite Programming. Springer, Berlin, pp 51–65

    Chapter  Google Scholar 

  12. Gustafson S-A (1983) A three-phase algorithm for semi-infinite programs. In: Fiacco AV, Kortanek KO (eds) Semi-Infinite Programming and Applications. Springer, Berlin, pp 138–157

    Google Scholar 

  13. Den Hertog D, Kaliski J, Roos C, Terlaky T (1995) A logarithmic barrier cutting plane method for convex programming. Ann Oper Res 58:69–98

    Article  MathSciNet  MATH  Google Scholar 

  14. Hettich R (1986) An implementation of a discretization method for semi-infinite programming. Math Program 34:354–361

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Hettich R, Zencke P (1982) Numerische Methoden der Approximation und semi-infiniten Optimierung. Teubner, Leipzig

    MATH  Google Scholar 

  18. Huth M (1987) Superlinear konvergente Verfahren zur Lösung semi-infiniter Optimierungsaufgaben - Eine Hybridmethode. PhD Thesis, Pädagogische Hochschule Halle, Halle, GDR

    Google Scholar 

  19. Huth M, Tichatschke R (1990) A hybrid method for semi-infinite programming problems. In: Rieder U et al (eds) Methods Oper Res 62. Anton Hain Verlag, Meisenheim, pp 79–90

    MathSciNet  Google Scholar 

  20. Kaliski J, Haglin D, Roos C, Terlaky T (1997) Logarithmic barrier decomposition methods for semi-infinite programming. Internat Trans Oper Res 4:285–303

    Article  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 (1993) Regularized penalty methods for semi-infinite programming problems. In: Brosowski B, Deutsch F, Guddat J (eds) Approximation & Optimization. P Lang, Frankfurt am Main, pp 341–356

    Google Scholar 

  23. Kaplan A, Tichatschke R (1994) Stable methods for ill-posed variational problems. Akademie, Berlin

    MATH  Google Scholar 

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

    Google Scholar 

  25. Mayne DQ, Polak E (1982) A superlinearly convergent algorithm for constrained optimization problems. Math Program Stud 16:45–61

    MathSciNet  MATH  Google Scholar 

  26. Mayne DQ, Polak E, Trahan R (1979) An outer approximations algorithm for computer-aided design problems. J Optim Th Appl 28:331–352

    Article  MathSciNet  MATH  Google Scholar 

  27. Mine H, Fukushima M, Tanaka Y (1984) On the use of ϵ-most-active constraints in an exact penalty function method for nonlinear optimization. IEEE Trans Autom Control AC-29:1040–1042

    Article  MathSciNet  Google Scholar 

  28. Panier 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 34:903–908

    Article  MathSciNet  MATH  Google Scholar 

  29. Polak E (1993) On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems. Math Program 62:385–414

    Article  MathSciNet  Google Scholar 

  30. Polak E (1997) Optimization. Algorithms and consistent approximations. Springer, Berlin

    MATH  Google Scholar 

  31. Polak E, He L (1991) Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization. J Optim Th Appl 69:83–107

    Article  MathSciNet  MATH  Google Scholar 

  32. 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 

  33. Polak E, Mayne DQ (1976) An algorithm for optimization problems with functional inequality constraints. IEEE Trans Autom Control AC-21:184–193

    Article  MathSciNet  Google Scholar 

  34. Polak E, Trahan R, Mayne DQ (1979) Combined phase I-phase II methods of feasible directions. Math Program 17:61–73

    Article  MathSciNet  MATH  Google Scholar 

  35. Potchinkov A, Reemtsen R (1994) FIR filter design in the complex domain by a semi-infinite programming technique I-II. Arch Elektronik und Übertragungstechnik 48:135–144; 200–209

    Google Scholar 

  36. 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 

  37. Powell MJD (1978) The convergence of variable metric methods for nonlinearly constrained optimization calculations. In: Mangasarian OL, Meyer RR, Robinson SM (eds) Nonlinear Programming 3. Acad Press, New York, pp 27–63

    Google Scholar 

  38. Powell MJD (1989) A tolerant algorithm for linearly constrained optimization calculations. Math Program 45:547–566

    Article  MathSciNet  MATH  Google Scholar 

  39. Powell MJD (1989) TOLMIN: A Fortran package for linearly constrained optimization calculations. Techn Report, DAMTP Univ Cambridge NA2

    Google Scholar 

  40. Reemtsen R (1991) Discretization methods for the solution of semi-infinite programming problems. J Optim Th Appl 71:85–103

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  43. Reemtsen R, Görner S (1998) Numerical methods for semi-infinite programming: A survey. In: Reemtsen R, Rückmann J-J (eds) Semi-Infinite Programming. Kluwer, Dordrecht, pp 195–275

    Google Scholar 

  44. Schittkowski K (1992) Solving nonlinear programming problems with very many constraints. Optim 25:179–196

    Article  MathSciNet  MATH  Google Scholar 

  45. Tanaka Y, Fukushima M, Ibaraki T (1988) A comparative study of several semi-infinite nonlinear programming algorithms. Europ J Oper Res 36:92–100

    Article  MathSciNet  MATH  Google Scholar 

  46. Tichatschke R (1979) Stetigkeitseigenschaften und Konvergenz von Folgen diskretisierter semi-infiniter konvexer Optimierungsaufgaben. Wiss Z TH Karl-Marx-Stadt 21:577–586

    MathSciNet  MATH  Google Scholar 

  47. Tichatschke R (1985) Semi-infinite programming problems. Banach Center Publ 14:543–554

    MathSciNet  Google Scholar 

  48. Tichatschke R, Schwartz B (1982) Methods of feasible directions for semi-infinite programming problems I-II. Wiss Inform TH Karl-Marx-Stadt 33:1–15; 16–23

    MathSciNet  Google Scholar 

  49. Volkov YV, Zavriev SK (1997) A general stochastic outer approximations method. SIAM J Control Optim 35:1387–1421

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Brandenburg Technical University Cottbus, Cottbus, Germany

    Rembert Reemtsen

Authors
  1. Rembert Reemtsen
    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

Reemtsen, R. (2008). Semi-infinite Programming: Discretization Methods . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_586

Download citation

Publish with us

Policies and ethics

Search

Navigation