Optimization pp 159-170 | Cite as

Improvement and implementation of some algorithms for nonconvex optimization problems

  • Tran Vu Thieu
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 1405)


Concave Function Linear Complementarity Problem Conical Algorithm Nonconvex Optimization Problem Nonbasic Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Falk, J., Hoffman, K.P., A successive underestimation method for concave minimization problems. Math. Oper. Res. 1 (1976), 251–259.CrossRefzbMATHGoogle Scholar
  2. [2]
    Hoffman, K.P., A method for globally minimizing concave functions over convex sets. Math. Programming. 20 (1981), 22–32.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [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. [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.MathSciNetCrossRefzbMATHGoogle Scholar
  5. [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.MathSciNetzbMATHGoogle Scholar
  6. [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.MathSciNetzbMATHGoogle Scholar
  7. [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. [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.MathSciNetCrossRefzbMATHGoogle Scholar
  9. [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.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    Tuy, H., Concave minimization under linear constraints with special structure. Optimization 16 (1985) 3, 335–352.MathSciNetCrossRefzbMATHGoogle Scholar
  11. [11]
    Tuy, H., Normal conical algorithm for concave minimization over polytopes. Preprint, Institute of Mathematics. Hanoi, 1988.Google Scholar

Copyright information

© Springer Verlag 1989

Authors and Affiliations

  • Tran Vu Thieu
    • 1
  1. 1.Institut de MathématiquesUniversité du LanguedocMontpellier CedexFrance

Personalised recommendations