Skip to main content
SpringerLink
Log in

A simple constraint qualification in infinite dimensional programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

A new, simple, constraint qualification for infinite dimensional programs with linear programming type constraints is used to derive the dual program; see Theorem 3.1. Applications include a proof of the explicit solution of the best interpolation problem presented in [8].

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.

Similar content being viewed by others

References

  1. A. Ben-Israel, “Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theory“,Journal of Mathematical Analysis and Applications 27 (1969) 367–389.

    Google Scholar 

  2. A. Ben-Israel, A. Ben-Tal and S. Zlobec,Optimality in non-linear programming: A feasible directions approach (Wiley, New York, 1981).

    Google Scholar 

  3. J.M. Borwein and H. Wolkowicz, “Characterizations of optimality for the abstract convex program with finite dimensional range“,Journal of the Australian Mathematical Society 30 (1981) 390–411.

    Google Scholar 

  4. J.M. Borwein and H. Wolkowicz, “Characterizations of optimality without constraint qualification for the abstract convex program“,Mathematical Programming Study 19 (1982) 77–100.

    Google Scholar 

  5. B.D. Craven and J.J. Koliha, “Generalizations of Farkas' theorem“,SIAM Journal on Mathematical Analysis 8 (1977) 938–997.

    Google Scholar 

  6. R.B. Holmes,Geometric functional analysis and its applications (Springer-Verlag, Berlin, 1975).

    Google Scholar 

  7. C. Kallina and A.C. Williams, “Linear programming in reflexive spaces“,SIAM Review 13 (1971) 350–376.

    Google Scholar 

  8. C.A. Micchelli, P.W. Smith, J. Swetits, and J.D. Ward, “ConstrainedL p approximation“,Journal of Constructive Approximation 1 (1985) 93–102.

    Google Scholar 

  9. H. Wolkowicz, “Some applications of optimization in matrix theory“,Linear Algebra and Its Applications 40 (1981) 101–118.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Statistics, and Computer Science, Dalhousie University, B3H 4H8, Halifax, N.S., Canada

    J. M. Borwein

  2. Department of Mathematical Sciences, University of Delaware, 19716, Newark, DE, USA

    H. Wolkowicz

Authors
  1. J. M. Borwein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Wolkowicz
    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

Borwein, J.M., Wolkowicz, H. A simple constraint qualification in infinite dimensional programming. Mathematical Programming 35, 83–96 (1986). https://doi.org/10.1007/BF01589443

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation