Relaxation schemes for mathematical programmes with switching constraints
From MaRDI portal
Abstract: Switching-constrained optimization problems form a difficult class of mathematical programs 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 the relaxation method from Kanzow and Schwartz (SIAM J. Optim., 23(2):770-798, 2013) for the numerical treatment of mathematical programs with complementarity constraints to the setting of switching-constrained optimization. It is shown that the proposed method computes M-stationary points under mild assumptions. Furthermore, we comment on other possible relaxation approaches which can be used to tackle mathematical programs with switching constraints. As it turns out, adapted versions of Scholtes' global relaxation scheme as well as the relaxation scheme of Steffensen and Ulbrich only find W-stationary points of switching-constrained optimization problems in general. Some computational experiments visualize the performance of the proposed relaxation method.
Recommendations
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- New relaxation method for mathematical programs with complementarity constraints
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
Cites work
- A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
- A new regularization scheme for mathematical programs with complementarity constraints
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Approximated perspective relaxations: a project and lift approach
- Benchmarking optimization software with performance profiles.
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Nonconvex penalization of switching control of partial differential equations
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On a relaxation method for mathematical programs with vanishing constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Optimal control of a diffusion/reaction/switching system
- Optimal switching boundary control of a string to rest in finite time
- Optimization and nonsmooth analysis
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Relaxation methods for mixed-integer optimal control of partial differential equations
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Solving optimal control problems with terminal complementarity constraints via Scholtes' relaxation scheme
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Switching control
- Switching in systems and control
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Time optimal controls of semilinear heat equation with switching control
- Variational Analysis
Cited in
(19)- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Topological approach to mathematical programs with switching constraints
- Optimality conditions for mathematical programs with orthogonality type constraints
- On the linear independence constraint qualification in disjunctive programming
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- Wolfe-type duality for mathematical programs with switching constraints
- An exact penalty approach for general ℓ 0 -sparse optimization problems
- Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
- Directionally variational analysis and second-order optimality conditions for mathematical programs with switching constraints
- Relaxation methods for optimal switching control of PDE-dynamical systems
- Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems
- Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
- On generalized alternative stationarity for mathematical programs with switching constraints
This page was built for publication: Relaxation schemes for mathematical programmes with switching constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865340)
