Gert Wanka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gert Wanka has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Radu Ioan Boţ
Faculty of Mathematics, University of Vienna, Vienna, Austria
17 shared publications - Sorin-Mihai Grad
Faculty of Mathematics, University of Duisburg-Essen, Essen, Germany
11 shared publications R.I. Boţ
Faculty of Mathematics, Chemnitz University of Technology, Reichenhaniner Str. 41, Zimmer 621, D-09107 Chemnitz, Germany
3 shared publicationsOleg Wilfer
Faculty of Mathematics, Chemnitz University of Technology , Chemnitz, Germany
2 shared publicationsR. I. Boţ
Chemnitz University of Technology
2 shared publicationsRadu Ioan Boţ
Faculty of Mathematics , Chemnitz University of Technology , D-09107 Chemnitz, Germany
2 shared publications
Latest Publications
- Open Access
- 24 December 2018
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 182 (1) , 110-132
The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
The Alternating Minimization Algorithm has been proposed by Paul Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. The fact that one of the subproblems to be solved within the iteration process of this method does not usually correspond to the calculation of a proximal operator through a closed formula affects the implementability of the algorithm. In this paper, we allow in each block of the objective a further smooth convex function and propose a proximal version of the algorithm, which is achieved by equipping the algorithm with proximal terms induced by variable metrics. For suitable choices of the latter, the solving of the two subproblems in the iterative scheme can be reduced to the computation of proximal operators. We investigate the convergence of the proposed algorithm in a real Hilbert space setting and illustrate its numerical performances on two applications in image processing and machine learning.
- 24 December 2018
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 182 (1) , 110-132
Open AccessThe Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
The Alternating Minimization Algorithm has been proposed by Paul Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. The fact that one of the subproblems to be solved within the iteration process of this method does not usually correspond to the calculation of a proximal operator through a closed formula affects the implementability of the algorithm. In this paper, we allow in each block of the objective a further smooth convex function and propose a proximal version of the algorithm, which is achieved by equipping the algorithm with proximal terms induced by variable metrics. For suitable choices of the latter, the solving of the two subproblems in the iterative scheme can be reduced to the computation of proximal operators. We investigate the convergence of the proposed algorithm in a real Hilbert space setting and illustrate its numerical performances on two applications in image processing and machine learning.
- 25 October 2017
- Published by Taylor & Francis in Optimization
- Vol. 67 (7) , 1095-1119
Duality results for extended multifacility location problems
Duality statements are presented for multifacility location problems as suggested by Drezner Hiu 1991, where for each given point the sum of weighted distances to all facilities plus set-up costs is determined and the maximal value of these sums is to be minimized. We develop corresponding dual problems for the cases with and without set-up costs and present associated optimality conditions. In the concluding part of this note we use these optimality conditions for a geometrical characterization of the set of optimal solutions and consider for an illustration corresponding examples.
- 25 October 2017
- Published by Taylor & Francis in Optimization
- Vol. 67 (7) , 1095-1119
Duality results for extended multifacility location problems
Duality statements are presented for multifacility location problems as suggested by Drezner Hiu 1991, where for each given point the sum of weighted distances to all facilities plus set-up costs is determined and the maximal value of these sums is to be minimized. We develop corresponding dual problems for the cases with and without set-up costs and present associated optimality conditions. In the concluding part of this note we use these optimality conditions for a geometrical characterization of the set of optimal solutions and consider for an illustration corresponding examples.
- 29 July 2017
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 86 (2) , 401-439
Duality results for nonlinear single minimax location problems via multi-composed optimization
- 29 July 2017
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 86 (2) , 401-439
Duality results for nonlinear single minimax location problems via multi-composed optimization
- 12 August 2016
- Published by Springer Nature in TOP
- Vol. 25 (2) , 288-313
A Lagrange duality approach for multi-composed optimization problems
- 12 August 2016
- Published by Springer Nature in TOP
- Vol. 25 (2) , 288-313
A Lagrange duality approach for multi-composed optimization problems
- 19 January 2015
- Published by Taylor & Francis in Optimization
- Vol. 64 (8) , 1759-1775
On biconjugates of infimal functions
We deliver formulae for the biconjugate functions of some infimal functions that hold provided the fulfilment of weak regularity conditions of both closedness and interiority types. As special cases, we obtain biconjugates of infimal convolutions of finitely many functions, of optimal value functions of both constrained and unconstrained optimization problems as well as of marginal functions associated with multifunctions (that can be, for instance, convex processes) and some given functions. Moreover, we rediscover or extend different results on biconjugate functions from the literature.
- 19 January 2015
- Published by Taylor & Francis in Optimization
- Vol. 64 (8) , 1759-1775
On biconjugates of infimal functions
We deliver formulae for the biconjugate functions of some infimal functions that hold provided the fulfilment of weak regularity conditions of both closedness and interiority types. As special cases, we obtain biconjugates of infimal convolutions of finitely many functions, of optimal value functions of both constrained and unconstrained optimization problems as well as of marginal functions associated with multifunctions (that can be, for instance, convex processes) and some given functions. Moreover, we rediscover or extend different results on biconjugate functions from the literature.
- Open Access
- 21 November 2013
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 12 (2) , 381-394
Employing different loss functions for the classification of images via supervised learning
Supervised learning methods are powerful techniques to learn a function from a given set of labeled data, the so-called training data. In this paper the support vector machines approach is applied to an image classification task. Starting with the corresponding Tikhonov regularization problem, reformulated as a convex optimization problem, we introduce a conjugate dual problem to it and prove that, whenever strong duality holds, the function to be learned can be expressed via the dual optimal solutions. Corresponding dual problems are then derived for different loss functions. The theoretical results are applied by numerically solving a classification task using high dimensional real-world data in order to obtain optimal classifiers. The results demonstrate the excellent performance of support vector classification for this particular problem.
- 21 November 2013
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 12 (2) , 381-394
Open AccessEmploying different loss functions for the classification of images via supervised learning
Supervised learning methods are powerful techniques to learn a function from a given set of labeled data, the so-called training data. In this paper the support vector machines approach is applied to an image classification task. Starting with the corresponding Tikhonov regularization problem, reformulated as a convex optimization problem, we introduce a conjugate dual problem to it and prove that, whenever strong duality holds, the function to be learned can be expressed via the dual optimal solutions. Corresponding dual problems are then derived for different loss functions. The theoretical results are applied by numerically solving a classification task using high dimensional real-world data in order to obtain optimal classifiers. The results demonstrate the excellent performance of support vector classification for this particular problem.
- 21 November 2010
- Published by Springer Nature in Optimization Letters
- Vol. 6 (1) , 199-210
Classical linear vector optimization duality revisited
- 21 November 2010
- Published by Springer Nature in Optimization Letters
- Vol. 6 (1) , 199-210
Classical linear vector optimization duality revisited
- Open Access
Classical linear vector optimization duality revisited
With this note we bring again into attention a vector dual problem neglected by the contributions who have recently announced the successful healing of the trouble encountered by the classical duals to the classical linear vector optimization problem. This vector dual problem has, different to the mentioned works which are of set-valued nature, a vector objective function. Weak, strong and converse duality for this "new-old" vector dual problem are proven and we also investigate its connections to other vector duals considered in the same framework in the literature. We also show that the efficient solutions of the classical linear vector optimization problem coincide with its properly efficient solutions (in any sense) when the image space is partially ordered by a nontrivial pointed closed convex cone, too.
Open AccessClassical linear vector optimization duality revisited
With this note we bring again into attention a vector dual problem neglected by the contributions who have recently announced the successful healing of the trouble encountered by the classical duals to the classical linear vector optimization problem. This vector dual problem has, different to the mentioned works which are of set-valued nature, a vector objective function. Weak, strong and converse duality for this "new-old" vector dual problem are proven and we also investigate its connections to other vector duals considered in the same framework in the literature. We also show that the efficient solutions of the classical linear vector optimization problem coincide with its properly efficient solutions (in any sense) when the image space is partially ordered by a nontrivial pointed closed convex cone, too.
- 5 May 2010
- Published by Springer Nature
- p. 185-197
Gap Functions for Vector Equilibrium Problems via Conjugate Duality
- 5 May 2010
- Published by Springer Nature
- p. 185-197
Gap Functions for Vector Equilibrium Problems via Conjugate Duality
- 1 January 2010
- Published by The Korean Mathematical Society in Journal of the Korean Mathematical Society
- Vol. 47 (1) , 17-28
DUALITY FOR LINEAR CHANCE-CONSTRAINED OPTIMIZATION PROBLEMS
- 1 January 2010
- Published by The Korean Mathematical Society in Journal of the Korean Mathematical Society
- Vol. 47 (1) , 17-28
DUALITY FOR LINEAR CHANCE-CONSTRAINED OPTIMIZATION PROBLEMS