Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On cutoff optimization methods in infinite-dimensional spaces and applications

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A general formulation of cutoff optimization methods in infinite-dimensional spaces is given. Various convergence aspects of these methods are proved under general assumptions. The concept of strong and weak convergence is studied. Estimates of convergence rates under certain assumptions are obtained. Applications to optimal control theory and approximation theory are illustrated.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Levitin, E. S. andPolyak, B. T.,Constrained Minimization Methods, USSR Computational Mathematics and Mathematical Physics (in English), Vol. 6, No. 5, 1968.

  2. Cheney, E. W., andGoldstein, A. A.,Newton's Method for Convex Programming and Tchebychoff Approximation, Numerische Mathematik, Vol. 1, No. 5, 1959.

  3. Eaves, C. B., andZangwill, W. I.,Generalized Cutting Plane Algorithms, Working Paper No. 274, Center for Research in Management Science, University of California at Berkeley, 1969.

  4. Kelley, J. E., Jr. The Cutting Plane Method for Solving Convex Programs, SIAM Journal on Applied Mathematics, Vol. 8, pp. 702–712, 1960.

    MathSciNet  Google Scholar 

  5. Topkis, D. M.,Cutting Plane Methods without Nested Constraints Sets, Operations Research, Vol. 18, No. 3, 1970.

  6. Topkis, D. M.,A Note on Cutting Plane Methods without Nested Constraints Sets, Operations Research, Vol. 18, No. 6, 1970.

  7. Veinott, A. F., Jr.,The Supporting Hyperplane Method for Unimodal Programming, Operations Research, Vol. 15, No. 1, 1967.

  8. Zangwill, W. I.,Non-Linear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.

    Google Scholar 

  9. Polyak, B. T.,Existence Theorems and Convergence of Minimizing Sequences in Extremum Problems with Restrictions, Soviet Mathematics, Vol. 7, No. 1, 1966.

  10. Dunford, N., andSchwartz, J. T.,Linear Operators, Part I, John Wiley and Sons, (Interscience Publishers), New York, 1967.

    Google Scholar 

  11. Levitin, E. S., andPolyok, B. T.,Convergence of Minimization Sequences in Conditional Extremum Problems, Soviet Mathematics, Vol. 7, No. 3, 1966.

  12. Kapur, K. C., andVan Slyke, R. M.,Cutting Plane Algorithms and State Space Constrained Linear Optimal Control Systems, Journal of Computer and System Sciences, Vol. 4, No. 6, 1970.

  13. Pschenichniy, B. N.,Linear Optimal Control Problems, SIAM, Journal on Control, Vol. 4, No. 4, 1966.

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Operations Research, College of Engineering, Wayne State University, Detroit, Michigan

    K. C. Kapur (Associate Professor)

Authors
  1. K. C. Kapur
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by M. R. Hestenes

The author gratefully acknowledges many helpful suggestions made by the referees.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kapur, K.C. On cutoff optimization methods in infinite-dimensional spaces and applications. J Optim Theory Appl 12, 16–31 (1973). https://doi.org/10.1007/BF00934833

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00934833

Keywords

Search

Navigation