Relaxation schemes for mathematical programmes with switching constraints
From MaRDI portal
Publication:5865340
DOI10.1080/10556788.2019.1663425zbMath1489.65086arXiv1809.02388OpenAlexW2976971525WikidataQ127205808 ScholiaQ127205808MaRDI QIDQ5865340
Daniel Steck, Patrick Mehlitz, Christian Kanzow
Publication date: 13 June 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.02388
global convergenceconstraint qualificationsrelaxation methodsmathematical programme with switching constraints
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (10)
Topological approach to mathematical programs with switching constraints ⋮ 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 ⋮ Optimality conditions for mathematical programs with orthogonality type constraints ⋮ On the linear independence constraint qualification in disjunctive programming ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Approximated perspective relaxations: a project and lift approach
- Relaxation methods for mixed-integer optimal control of partial differential equations
- Optimal control of a diffusion/reaction/switching system
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Switching control
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Switching in systems and control
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Nonconvex penalization of switching control of partial differential equations
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Time optimal controls of semilinear heat equation with switching control
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Solving optimal control problems with terminal complementarity constraints via Scholtes' relaxation scheme
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Optimization and nonsmooth analysis
- Variational Analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On a relaxation method for mathematical programs with vanishing constraints
- A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Optimal switching boundary control of a string to rest in finite time
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Benchmarking optimization software with performance profiles.
This page was built for publication: Relaxation schemes for mathematical programmes with switching constraints
