Daniel Steck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Daniel Steck has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Christian Kanzow
University of Würzburg
5 shared publications Christian Kanzow
2 shared publicationsKainan Sun
Department of Occupational and Environmental Health, Department of Biostatistics, College of Public Health, University of Iowa, Iowa City, IA 52242, USA
1 shared publication- Patrick Mehlitz
Department of Mathematics and Computer Science, Philipps-Universität Marburg, Marburg, Germany
1 shared publication - R. William Field
Department of Occupational and Environmental Health, College of Public Health, University of Iowa, Iowa City, IA 52242, USA
1 shared publication
Latest Publications
- 25 September 2019
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 36 (6) , 1223-1258
Relaxation schemes for mathematical programmes with switching constraints
Switching-constrained optimization problems form a difficult class of mathematical programmes since their feasible set is almost disconnected while standard constraint qualifications are likely to fail at several feasible points. That is why the application of standard methods from nonlinear programming does not seem to be promising in order to solve such problems. In this paper, we adapt several relaxation methods which are well known from the numerical treatment of mathematical programmes with complementarity constraints to the setting of switching-constrained optimization. A detailed convergence analysis is provided for the adapted relaxation schemes of Scholtes as well as Kanzow and Schwartz. While Scholtes' method and the relaxation scheme of Steffensen and Ulbrich only find weakly stationary points in general, it is shown that the adapted relaxation scheme of Kanzow and Schwartz is capable of identifying Mordukhovich-stationary points of switching-constrained programmes under suitable assumptions. Some computational experiments and a numerical comparison of the proposed methods based on examples from logical programming, switching control, and portfolio optimization close the paper.
- 25 September 2019
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 36 (6) , 1223-1258
Relaxation schemes for mathematical programmes with switching constraints
Switching-constrained optimization problems form a difficult class of mathematical programmes since their feasible set is almost disconnected while standard constraint qualifications are likely to fail at several feasible points. That is why the application of standard methods from nonlinear programming does not seem to be promising in order to solve such problems. In this paper, we adapt several relaxation methods which are well known from the numerical treatment of mathematical programmes with complementarity constraints to the setting of switching-constrained optimization. A detailed convergence analysis is provided for the adapted relaxation schemes of Scholtes as well as Kanzow and Schwartz. While Scholtes' method and the relaxation scheme of Steffensen and Ulbrich only find weakly stationary points in general, it is shown that the adapted relaxation scheme of Kanzow and Schwartz is capable of identifying Mordukhovich-stationary points of switching-constrained programmes under suitable assumptions. Some computational experiments and a numerical comparison of the proposed methods based on examples from logical programming, switching control, and portfolio optimization close the paper.
- Open Access
Quasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods
This paper deals with quasi-variational inequality problems (QVIs) in a generic Banach space setting. We provide a theoretical framework for the analysis of such problems which is based on two key properties: the pseudomonotonicity (in the sense of Brezis) of the variational operator and a Mosco-type continuity of the feasible set mapping. We show that these assumptions can be used to establish the existence of solutions and their computability via suitable approximation techniques. In addition, we provide a practical and easily verifiable sufficient condition for the Mosco-type continuity property in terms of suitable constraint qualifications. Based on the theoretical framework, we construct an algorithm of augmented Lagrangian type which reduces the QVI to a sequence of standard variational inequalities. A full convergence analysis is provided which includes the existence of solutions of the subproblems as well as the attainment of feasibility and optimality. Applications and numerical results are included to demonstrate the practical viability of the method.
Open AccessQuasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods
This paper deals with quasi-variational inequality problems (QVIs) in a generic Banach space setting. We provide a theoretical framework for the analysis of such problems which is based on two key properties: the pseudomonotonicity (in the sense of Brezis) of the variational operator and a Mosco-type continuity of the feasible set mapping. We show that these assumptions can be used to establish the existence of solutions and their computability via suitable approximation techniques. In addition, we provide a practical and easily verifiable sufficient condition for the Mosco-type continuity property in terms of suitable constraint qualifications. Based on the theoretical framework, we construct an algorithm of augmented Lagrangian type which reduces the QVI to a sequence of standard variational inequalities. A full convergence analysis is provided which includes the existence of solutions of the subproblems as well as the attainment of feasibility and optimality. Applications and numerical results are included to demonstrate the practical viability of the method.
- Open Access
- 16 November 2018
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 181 (1) , 318-323
Brezis Pseudomonotonicity is Strictly Weaker than Ky–Fan Hemicontinuity
- 16 November 2018
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 181 (1) , 318-323
Open AccessBrezis Pseudomonotonicity is Strictly Weaker than Ky–Fan Hemicontinuity
- 17 March 2018
- Published by Springer Nature in Mathematical Programming
- Vol. 177 (1-2) , 425-438
Improved local convergence results for augmented Lagrangian methods in ${\varvec{C}}^\mathbf{2}$C2-cone reducible constrained optimization- 17 March 2018
- Published by Springer Nature in Mathematical Programming
- Vol. 177 (1-2) , 425-438
Improved local convergence results for augmented Lagrangian methods in ${\varvec{C}}^\mathbf{2}$C2-cone reducible constrained optimization- 11 November 2017
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 69 (3) , 801-824
Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
- 11 November 2017
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 69 (3) , 801-824
Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
- 1 November 2017
- Published by Elsevier in Operations Research Letters
- Vol. 45 (6) , 598-603
An example comparing the standard and safeguarded augmented Lagrangian methods
- 1 November 2017
- Published by Elsevier in Operations Research Letters
- Vol. 45 (6) , 598-603
An example comparing the standard and safeguarded augmented Lagrangian methods
- 10 July 2017
- Published by Taylor & Francis in Optimization
- Vol. 66 (10) , 1667-1676
A generalized proximal-point method for convex optimization problems in Hilbert spaces
We deal with a generalization of the proximal-point method and the closely related Tikhonov regularization method for convex optimization problems. The prime motivation behind this is the well-known connection between the classical proximal-point and augmented Lagrangian methods, and the emergence of modified augmented Lagrangian methods in recent years. Our discussion includes a formal proof of a corresponding connection between the generalized proximal-point method and the modified augmented Lagrange approach in infinite dimensions. Several examples and counterexamples illustrate the convergence properties of the generalized proximal-point method and indicate that the corresponding assumptions are sharp.
- 10 July 2017
- Published by Taylor & Francis in Optimization
- Vol. 66 (10) , 1667-1676
A generalized proximal-point method for convex optimization problems in Hilbert spaces
We deal with a generalization of the proximal-point method and the closely related Tikhonov regularization method for convex optimization problems. The prime motivation behind this is the well-known connection between the classical proximal-point and augmented Lagrangian methods, and the emergence of modified augmented Lagrangian methods in recent years. Our discussion includes a formal proof of a corresponding connection between the generalized proximal-point method and the modified augmented Lagrange approach in infinite dimensions. Several examples and counterexamples illustrate the convergence properties of the generalized proximal-point method and indicate that the corresponding assumptions are sharp.
- 1 January 2016
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 26 (4) , 2034-2058
Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems
We propose an augmented Lagrangian-type algorithm for the solution of generalized Nash equilibrium problems (GNEPs). Specifically, we discuss the convergence properties with regard to both feasibil...
- 1 January 2016
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 26 (4) , 2034-2058
Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems
We propose an augmented Lagrangian-type algorithm for the solution of generalized Nash equilibrium problems (GNEPs). Specifically, we discuss the convergence properties with regard to both feasibil...
- 1 January 2010
- Published by Wolters Kluwer Health in Health Physics
- Vol. 98 (1) , 29-36
ROOM MODEL BASED MONTE CARLO SIMULATION STUDY OF THE RELATIONSHIP BETWEEN THE AIRBORNE DOSE RATE AND THE SURFACE-DEPOSITED RADON PROGENY
The quantitative relationships between radon gas concentration, the surface-deposited activities of various radon progeny, the airborne radon progeny dose rate, and various residential environmental factors were investigated through a Monte Carlo simulation study based on the extended Jacobi room model. Airborne dose rates were calculated from the unattached and attached potential alpha-energy concentrations (PAECs) using two dosimetric models. Surface-deposited (218)Po and (214)Po were significantly correlated with radon concentration, PAECs, and airborne dose rate (p-values <0.0001) in both non-smoking and smoking environments. However, in non-smoking environments, the deposited radon progeny were not highly correlated to the attached PAEC. In multiple linear regression analysis, natural logarithm transformation was performed for airborne dose rate as a dependent variable, as well as for radon and deposited (218)Po and (214)Po as predictors. In non-smoking environments, after adjusting for the effect of radon, deposited (214)Po was a significant positive predictor for one dose model (RR 1.46, 95% CI 1.27-1.67), while deposited (218)Po was a negative predictor for the other dose model (RR 0.90, 95% CI 0.83-0.98). In smoking environments, after adjusting for radon and room size, deposited (218)Po was a significant positive predictor for one dose model (RR 1.10, 95% CI 1.02-1.19), while a significant negative predictor for the other model (RR 0.90, 95% CI 0.85-0.95). After adjusting for radon and deposited (218)Po, significant increases of 1.14 (95% CI 1.03-1.27) and 1.13 (95% CI 1.05-1.22) in the mean dose rates were found for large room sizes relative to small room sizes in the different dose models.
- 1 January 2010
- Published by Wolters Kluwer Health in Health Physics
- Vol. 98 (1) , 29-36
ROOM MODEL BASED MONTE CARLO SIMULATION STUDY OF THE RELATIONSHIP BETWEEN THE AIRBORNE DOSE RATE AND THE SURFACE-DEPOSITED RADON PROGENY
The quantitative relationships between radon gas concentration, the surface-deposited activities of various radon progeny, the airborne radon progeny dose rate, and various residential environmental factors were investigated through a Monte Carlo simulation study based on the extended Jacobi room model. Airborne dose rates were calculated from the unattached and attached potential alpha-energy concentrations (PAECs) using two dosimetric models. Surface-deposited (218)Po and (214)Po were significantly correlated with radon concentration, PAECs, and airborne dose rate (p-values <0.0001) in both non-smoking and smoking environments. However, in non-smoking environments, the deposited radon progeny were not highly correlated to the attached PAEC. In multiple linear regression analysis, natural logarithm transformation was performed for airborne dose rate as a dependent variable, as well as for radon and deposited (218)Po and (214)Po as predictors. In non-smoking environments, after adjusting for the effect of radon, deposited (214)Po was a significant positive predictor for one dose model (RR 1.46, 95% CI 1.27-1.67), while deposited (218)Po was a negative predictor for the other dose model (RR 0.90, 95% CI 0.83-0.98). In smoking environments, after adjusting for radon and room size, deposited (218)Po was a significant positive predictor for one dose model (RR 1.10, 95% CI 1.02-1.19), while a significant negative predictor for the other model (RR 0.90, 95% CI 0.85-0.95). After adjusting for radon and deposited (218)Po, significant increases of 1.14 (95% CI 1.03-1.27) and 1.13 (95% CI 1.05-1.22) in the mean dose rates were found for large room sizes relative to small room sizes in the different dose models.