Skip to main content
SpringerLink
Log in

An Approximation Approach to Non-strictly Convex Quadratic Semi-infinite Programming

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We present in this paper a numerical method for solving non-strictly-convex quadratic semi-infinite programming including linear semi-infinite programming. The proposed method transforms the problem into a series of strictly convex quadratic semi-infinite programming problems. Several convergence results and a numerical experiment are given.

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

  • Fang, S.-C., Lin, C.-J. and Wu, S.-Y. (1994), On solving convex quadratic semi-infinite programming problems, Optimization 31, 107-125.

    Article  Google Scholar 

  • Goberna, M. A. and López, M. A. (1998), Linear Semi-Infinite Optimization, Wiley, Chichester, England.

    Google Scholar 

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

    Article  Google Scholar 

  • Ito, S., Liu, Y. and Teo, K. L. (2000), A dual parametrization method for convex semi-infinite programming, Annals of Operations Research 98, 189-213.

    Article  Google Scholar 

  • Liu, Y., Teo, K. L. and Ito, S. (1999) A dual parametrization approach to linear-quadratic semi-infinite programming problems, Optimization Methods and Software 10, 471-495.

    Article  Google Scholar 

  • Liu, Y., Ito, S., Lee, J. H. W. and Teo, K. L. (2001a), A semi-infinite programming approach to continuously constrained LQ optimal control problems, Journal of Optimization Theory and Applications 108, 617-632.

    Article  Google Scholar 

  • Liu, Y., Teo, K. L. and Ito, S. (2001b), Global optimization in LQ semi-infinite programming, Computing 15, 119-132.

    Google Scholar 

  • Polak, E. (1997), Optimization: Algorithms and Consistent Approximations, Springer, New York.

    Google Scholar 

  • Reemtsen, R. and Rückmann, J.-J. (eds.) (1998), Semi-Infinite Programming, Kluwer Academic, Boston, MA.

    Google Scholar 

  • Shimizu, K., Ishizuka, Y. and Bard, J. F. (1997), Nondifferentiable and Two-Level Mathematical Programming, Kluwer Academic, Boston, MA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Statistical Mathematics, Tokyo, 106-8569, Japan

    S. Ito

  2. Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

    Y. Liu & K. L. Teo

Authors
  1. S. Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. L. Teo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ito, S., Liu, Y. & Teo, K.L. An Approximation Approach to Non-strictly Convex Quadratic Semi-infinite Programming. J Glob Optim 30, 195–206 (2004). https://doi.org/10.1007/s10898-004-8278-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-004-8278-8

Search

Navigation