A wooden table in front of a blackboard. On the desk are books, chalk and coffee mugs.
Image: AI-generated
Publications
Peer-reviewed publications
Dörfler, D., Löhne, A.: A polyhedral approximation algorithm for recession cones of spectrahedral shadows. J. Nonlinear Var. Anal. 8(4), 549-569 (2024). articleExternal link, preprintExternal link.
Dörfler, D., Löhne, A.: Convex sets approximable as the sum of a compact set and a cone. J. Nonlinear Var. Anal. 8(4), 681-689 (2024). articleExternal link, preprintExternal link.
Dörfler, D., Löhne, A.: Polyhedral approximation of spectrahedral shadows via homogenization. J. Optim. Theory Appl. 200(2), 874-890 (2024). articleExternal link, preprintExternal link.
Dörfler, D.: On the approximation of unbounded convex sets by polyhedra. J. Optim. Theory Appl. 194(1), 265-287 (2022). articleExternal link, preprintExternal link.
Dörfler, D., Löhne, A., Schneider, C., Weißing, B.: A Benson-type algorithm for bounded convex vector optimization problems with vertex selection. Optim. Methods Softw. 37(3), 1006-1026 (2022). articleExternal link, preprintExternal link.
Löhne, A., Dörfler, D., Rittmann, A., Weißing, B.: Solving bilevel problems with polyhedral constraint set. J. Appl. Numer. Optim. 1(3), 243-251 (2019). articleExternal link.
Dörfler, D., Löhne, A.: Geometric duality and parametric duality for multiple objective linear programs are equivalent. J. Nonlinear Convex Anal. 19(7), 1181-1188 (2018). articleExternal link, preprintExternal link.