Skip to main content
SpringerLink
Log in

An algorithm for minimizing nondifferentiable convex functions under linear constraints

  • Nondifferentiable Optimization
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 59))

  • 134 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bihain, V.H. Nguyen and J.-J. Strodiot, "A reduced subgradient algorithm", submitted for publication.

    Google Scholar 

  2. J. Chatelon, D. Hearn and T. Lowe, "A subgradient algorithm for certain minimax and minisum problems", SIAM Journal on Control and Optimization 20 (1982) 455–469.

    Google Scholar 

  3. P. Huard, "Un algorithme général de gradient réduit", Bulletin de la Direction des Etudes et Recherches, E.D.F., Série C, no 2 (1982) 91–109.

    Google Scholar 

  4. C. Lemarechal, "An extension of Davidon methods to non-differentiable problems", Mathematical Programming Study 3 (1975) 95–109.

    Google Scholar 

  5. C. Lemarechal and R. Mifflin, eds., Nonsmooth Optimization (Pergamon Press, New York, 1977).

    Google Scholar 

  6. D. Luenberger, Introduction to Linear and Nonlinear Programming (Academic Press, New York, 1973).

    Google Scholar 

  7. K. Madsen and H. Schjaer-Jacobsen, "Linearly constrained minimax optimization", Mathematical Programming 14 (1978) 208–223.

    Google Scholar 

  8. R. Mifflin, "A stable method for solving certain constrained least squares problems", Mathematical Programming 16 (1979) 141–158.

    Google Scholar 

  9. V.H. Nguyen and J.-J. Strodiot, "A linearly constrained algorithm not requiring derivative continuity", Engineering Structures (in press).

    Google Scholar 

  10. R. Rockafellar, Convex Analysis (Princeton University Press, Princeton NJ, 1970).

    Google Scholar 

  11. R. Saigal, "The fixed point approach to nonlinear programming", Mathematical Programming Study 10 (1979) 142–157.

    Google Scholar 

  12. J.-J. Strodiot, V.H. Nguyen and N. Heukemes, "ɛ-optimal solutions in nondifferentiable convex programming and some related questions", Mathematical Programming 25 (1983) 307–328.

    Google Scholar 

  13. Ph. Wolfe, "A method of conjugate subgradients for minimizing nondifferentiable functions", Mathematical Programming Study 3 (1975) 145–173.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultés Universitaires N.-D. de la Paix, Namur, Belgium

    J. -J. Strodiot & V. H. Nguyen

Authors
  1. J. -J. Strodiot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. H. Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Thoft-Christensen

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Strodiot, J.J., Nguyen, V.H. (1984). An algorithm for minimizing nondifferentiable convex functions under linear constraints. In: Thoft-Christensen, P. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008907

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13185-4

  • Online ISBN: 978-3-540-38828-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation