Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems

DOI10.1007/s11228-014-0297-0zbMath1312.49036OpenAlexW2000498371MaRDI QIDQ2018769

Konstantin Palagachev, Matthias Gerdts

Publication date: 25 March 2015

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-014-0297-0

zbMATH Keywords

discretizationrelaxation techniquemixed-integer optimal controlflight path optimizationblocks of vanishing constraintsvariable time transformation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30) Applications of optimal control and differential games (49N90) Existence theories for optimal control problems involving ordinary differential equations (49J15) Discrete approximations in optimal control (49M25) Numerical methods of relaxation type (49M20)

Related Items (5)

Computational approaches for mixed integer optimal control problems with indicator constraints ⋮ Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control ⋮ On the linear independence constraint qualification in disjunctive programming ⋮ On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function ⋮ Second order variational analysis of disjunctive constraint sets and its applications to optimization problems

Uses Software

• SODAS
• MuShROOM
• qpHPSC

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal control of ODEs and DAEs.
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Direct methods with maximal lower bound for mixed-integer optimal control problems
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• Control parametrization enhancing technique for optimal discrete-valued control problems
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Functional Analysis, Calculus of Variations and Optimal Control
• An approximate maximum principle for finite-difference control systems
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Optimization and nonsmooth analysis
• Abstract cone approximations and generalized differentiability in nonsmooth optimization
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• Variational Analysis and Generalized Differentiation I
• Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
• Extremum problems in the presence of restrictions

This page was built for publication: Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems