Skip to main content
SpringerLink
Log in

Error bounds of two smoothing approximations for semi-infinite minimax problems

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

In the paper we investigate smoothing method for solving semi-infinite minimax problems. Not like most of the literature in semi-infinite minimax problems which are concerned with the continuous time version(i.e., the one dimensional semi-infinite minimax problems), the primary focus of this paper is on multidimensional semi-infinite minimax problems. The global error bounds of two smoothing approximations for the objective function are given and compared. It is proved that the smoothing approximation given in this paper can provide a better error bound than the existing one in literature.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bertsekas, D. Minmax methods based on approximation. Proceeding of the 1976 Johns Hopkins Conference on Information Sciences and Systems, Baltimore, 1976

  2. Bertsekas, D.P. Nondifferentiable optimization via approximation. Mathematical Programming Study, 3: 1–25 (1975)

    MathSciNet  Google Scholar 

  3. Charalambous, C. Cceleration of the least pth algorithm for minimax optimization with engineering applications. Mathematical Programming, 17: 270–297 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gigola, C., Monaco, S. A regularization method for solving the finite convex min-max problem. SIAM Journal on Numerical Analysis, 27: 1621–1634 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hettich, R., Kortanek, K.O. Semi-infinite programming: theory, methods and applications. SIAM Review, 35: 380–429 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Li, X.S. An aggregate function method for nonlinear programming. Science in China (A), 34: 1467–1473 (1991)

    MATH  Google Scholar 

  7. Li, X.S. An entropy-based aggregate method for minimax optimization. Engineering Optimization, 14: 277–285 (1997)

    Google Scholar 

  8. Mayne, D.Q., Polak, E. Nondifferentiable optimization via adaptive smoothing. Journal of Optimization Theory and Applications, 43: 601–614 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Micchelli, C., Smith, P.W., Swetits, J., Ward, J.D. Constrained l p approximation. Constructive Approximation, 1: 93–102 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  10. Peng, J., Lin, Z. A non-interior continuation method for generalized linear complementarity problems. Mathematical Programming, 86: 533–563 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Polak, E. On the mathematical foundations of nondifferentiable optimization in engineering design. SIAM Review, 29: 21–89 (1987)

    Article  MathSciNet  Google Scholar 

  12. Polak, E. Smooth optimization methods for minimax problems. SIAM Journal of Control and Optimization, 26: 1274–1286 (1988)

    Article  Google Scholar 

  13. Polak, E. Optimization: algorithms and consistent approximations. Springer-Verlag, New York, 1997

    MATH  Google Scholar 

  14. Polak, E., Royset, J.O., Womersley, R.S. Algorithms with adaptive smoothing for finite min-max problems. Journal of Optimization Theory and Applications, 119: 459–484 (2002)

    Article  MathSciNet  Google Scholar 

  15. Polak, E., Salcudean, S., Mayne, D.Q. Adaptive control of ARMA plants using worst case desigh by semi-infinite optimization. IEEE Transactions on Automatic Control, 32: 388–396 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  16. Polak, E., Womersley, R.S., Yin, H.X. An algorithm based on active sets and smoothing for Discretized semi-infite minimax problems. Journal of Optimization Theory and Applications, 138: 311–328 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  17. Rockafellar, R., Wets, R.B. Variational analysis. Springer-Verlag, New York, 1998

    Book  MATH  Google Scholar 

  18. Shimizu, K., Ishizuka, Y., Bard, J.F. Nondifferentiable and two-level mathematical programming. Kluwer Academic Publishers, New York, 1997

    MATH  Google Scholar 

  19. Sloan, I.H., Womersley, R.S. Extremal systems of points and numerical integration on the sphere. Advances in Computational Mathematics, 21(1–2): 107–125 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  20. Womersley, R.S. A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere. ANZIAM, 42(E): C1536–C1557 (2000)

    MathSciNet  Google Scholar 

  21. Xu, S. Smoothing method for minmax problems. Computational Optimization and Applications, 20: 267–279 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zang, I. A smoothing-out technique for min-max optimization. Mathematical Programming, 31: 61–77 (1980)

    Article  MathSciNet  Google Scholar 

  23. Zhou, J.L., Tits, A.L. An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM Jourrnal on Numerical Analysis, 6: 461–487 (1996)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Minnesota State University Mankato, 273 Wissink Hall, Mankato, MN, 56001, USA

    Hong-xia Yin

Authors
  1. Hong-xia Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong-xia Yin.

Additional information

Supported by the National Natural Science Foundation of China (No. 10671203, No. 70621001) and the faculty research grant at MSU.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yin, Hx. Error bounds of two smoothing approximations for semi-infinite minimax problems. Acta Math. Appl. Sin. Engl. Ser. 25, 685–696 (2009). https://doi.org/10.1007/s10255-008-8828-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-008-8828-9

Keywords

2000 MR Subject Classification

Search

Navigation