Skip to main content
SpringerLink
Log in

An extension of the frank and Wolfe method of feasible directions

  • Published:
Mathematical Programming Submit manuscript

Abstract

The Frank and Wolfe method of feasible directions is shown to be a case of the more general computational approach of inner linearization followed by restriction. An extension is proposed based on this observation. The extended procedure converges, and under certain conditions the asymptotic convergence rate is geometric. Limited computational experience comparing the two procedures is reported.

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. N.K. Boudwin, Jr., “Mathematical programming approaches to multi-stage decision processes”, Ph.D. Dissertation, Graduate School of Business, Stanford University, Stanford, Calif. (1972, unpublished).

    Google Scholar 

  2. A.R. Colville, “A comparative study on nonlinear programming codes”, IBM New York Scientific Center Rept. No. 320-2949 (1968).

  3. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J., 1963).

    Google Scholar 

  4. M. Frank and P. Wolfe, “An algorithm for quadratic programming”,Naval Research Logistics Quarterly 3 (1, 2) (1956).

  5. A.M. Geoffrion, “Elements of large-scale mathematical programming”,Management Science 16 (11) (1970).

  6. A.M. Geoffrion, “Duality in nonlinear programming: A simplified applications-oriented development”,SIAM Review 13 (1) (1971).

  7. C.A. Holloway, “A mathematical programming approach to identification and optimization of complex operational systems, with the aggregate planning problem as an example”, Ph.D. Dissertation, University of California, Los Angeles, Calif. (1969, unpublished).

    Google Scholar 

  8. C.A. Holloway, “A generalized approach to Dantzig—Wolfe decomposition for concave programs”,Operations Research 21 (1) (1973).

  9. P. Wolfe, “Methods of nonlinear programming”, in:Recent advances in mathematical programming Eds. R.L. Graves and P. Wolfe (McGraw—Hill, New York, 1963).

    Google Scholar 

  10. P. Wolfe, “Convergence theory in nonlinear programming”, in:Integer and nonlinear programming Ed. J. Abadie (North-Holland, Amsterdam, 1970).

    Google Scholar 

  11. G. Zoutendijk,Methods of feasible directions, a study in linear and non-linear programming (Elsevier, Amsterdam, 1960).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford, Calif., USA

    Charles A. Holloway

Authors
  1. Charles A. Holloway
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The author is grateful to Mr. Peter Friesen for help with the computational work and to the Graduate School of Business, Stanford University for their support of this research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Holloway, C.A. An extension of the frank and Wolfe method of feasible directions. Mathematical Programming 6, 14–27 (1974). https://doi.org/10.1007/BF01580219

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation