Narrow search
Showing 1 - 4 of 4
Cover Image
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
Birgin, E.; Martínez, J.; Prudente, L. - In: Journal of Global Optimization 58 (2014) 2, pp. 207-242
time by the new algorithms and optimal infeasibility results will be proved. On the other hand, finite termination results … intermediate steps of the method, which improves the overall efficiency. Experiments showing how the new algorithms and results are …
Persistent link: https://www.econbiz.de/10010994122
Cover Image
Benson type algorithms for linear vector optimization and applications
Hamel, Andreas; Löhne, Andreas; Rudloff, Birgit - In: Journal of Global Optimization 59 (2014) 4, pp. 811-836
New versions and extensions of Benson’s outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each iteration rather than two or three as in previous...
Persistent link: https://www.econbiz.de/10010994156
Cover Image
Duality theorems and algorithms for linear programming in measure spaces
Wen, C.F.; Wu, S.Y. - In: Journal of Global Optimization 30 (2004) 2, pp. 207-233
Persistent link: https://www.econbiz.de/10008925230
Cover Image
Primal and dual approximation algorithms for convex vector optimization problems
Löhne, Andreas; Rudloff, Birgit; Ulus, Firdevs - In: Journal of Global Optimization 60 (2014) 4, pp. 713-736
Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms … approximation algorithm, and the second one is a dual variant of it. Both algorithms provide an inner as well as an outer …
Persistent link: https://www.econbiz.de/10011151248