Improvement and implementation of some algorithms for nonconvex optimization problems
Part of the Lecture Notes in Mathematics book series (LNM, volume 1405)
KeywordsConcave 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.
- 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
- 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
- Tuy, H., Normal conical algorithm for concave minimization over polytopes. Preprint, Institute of Mathematics. Hanoi, 1988.Google Scholar
© Springer Verlag 1989