Relaxation schemes for mathematical programmes with switching constraints
- 25 September 2019
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 36 (6) , 1223-1258
Abstract
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.Keywords
Funding Information
- Deutsche Forschungsgemeinschaft - DFG (KA 1296/24-1)
This publication has 32 references indexed in Scilit:
- On a relaxation method for mathematical programs with vanishing constraintsGAMM-Mitteilungen, 2012
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraintsOptimization Methods and Software, 2012
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence propertiesOptimization, 2012
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraintsMathematical Programming, 2011
- Switching controlJournal of the European Mathematical Society, 2010
- A New Regularization Scheme for Mathematical Programs with Complementarity ConstraintsSIAM Journal on Optimization, 2009
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualificationsJournal of Mathematical Analysis and Applications, 2008
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQPOperations Research Letters, 2007
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity ConstraintsSIAM Journal on Optimization, 2001