Skip to main content
SpringerLink
Log in

Improvement and implementation of some algorithms for nonconvex optimization problems

  • Conference paper
  • First Online:
Optimization

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1405))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Falk, J., Hoffman, K.P., A successive underestimation method for concave minimization problems. Math. Oper. Res. 1 (1976), 251–259.

    Article  MATH  Google Scholar 

  2. Hoffman, K.P., A method for globally minimizing concave functions over convex sets. Math. Programming. 20 (1981), 22–32.

    Article  MathSciNet  MATH  Google Scholar 

  3. Horst, R., de Vries, J., Thoai, N.V., On finding new vertices and redundant constraints in cutting plane algorithms for global optimization. Preprint, Department of Mathematics, University of Trier, 1987.

    Google Scholar 

  4. Matheis, T.H., Rubin, D.S., A survey and comparison of methods for finding all vertices of convex polyhedral sets. Math. Oper. Res. 5 (1980) 2, 167–184.

    Article  MathSciNet  MATH  Google Scholar 

  5. Thieu, T.V., Tam, B.T., Ban, V.T., An outer approximation method for globally minimizing a concave function over a compact convex set. Acta Math. Vietnamica. 8 (1983) 1, 21–40.

    MathSciNet  MATH  Google Scholar 

  6. Thieu, T.V., A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications. Acta Math. Vietnamica. 9 (1984) 2, 173–191.

    MathSciNet  MATH  Google Scholar 

  7. Thieu, T.V., Solving the lay-out planning problem with concave cost. Essays on Nonlinear Analysis and Optimization Problems. Hanoi, 1987, 101–110.

    Google Scholar 

  8. Thieu, T.V., A note on the solution of bilinear programming problems by reduction to concave minimization. Math. Programming. 41 (1988) 2, 249–260.

    Article  MathSciNet  MATH  Google Scholar 

  9. Tuy, H., Thieu T.V. and Thai, N.Q., A conical algorithm for globally minimizing a concave function over a closed convex set. Math. Oper. Res. 10 (1985) 3, 498–514.

    Article  MathSciNet  MATH  Google Scholar 

  10. Tuy, H., Concave minimization under linear constraints with special structure. Optimization 16 (1985) 3, 335–352.

    Article  MathSciNet  MATH  Google Scholar 

  11. Tuy, H., Normal conical algorithm for concave minimization over polytopes. Preprint, Institute of Mathematics. Hanoi, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Mathématiques, Université du Languedoc, Pláce E. Bataillon, 34060, Montpellier Cedex, France

    Tran Vu Thieu

Authors
  1. Tran Vu Thieu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Szymon Dolecki

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer Verlag

About this paper

Cite this paper

Thieu, T.V. (1989). Improvement and implementation of some algorithms for nonconvex optimization problems. In: Dolecki, S. (eds) Optimization. Lecture Notes in Mathematics, vol 1405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083593

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51970-6

  • Online ISBN: 978-3-540-46867-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation