Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems
DOI10.1007/S11228-014-0297-0zbMATH Open1312.49036OpenAlexW2000498371MaRDI QIDQ2018769FDOQ2018769
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
Recommendations
- On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Approximation properties and tight bounds for constrained mixed-integer optimal control
- On a relaxation method for mathematical programs with vanishing constraints
- Solution of discrete optimal control problems via mathematical programming
discretizationrelaxation techniquemixed-integer optimal controlflight path optimizationblocks of vanishing constraintsvariable time transformation
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mixed integer programming (90C11) Existence theories for optimal control problems involving ordinary differential equations (49J15) Discrete approximations in optimal control (49M25) Applications of optimal control and differential games (49N90) Numerical methods of relaxation type (49M20)
Cites Work
- Title not available (Why is that?)
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Functional Analysis, Calculus of Variations and Optimal Control
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Variational Analysis and Generalized Differentiation I
- Optimal control of ODEs and DAEs.
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- 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
- An approximate maximum principle for finite-difference control systems
- Extremum problems in the presence of restrictions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Abstract cone approximations and generalized differentiability in nonsmooth optimization
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
Cited In (5)
- Computational approaches for mixed integer optimal control problems with indicator constraints
- Second order variational analysis of disjunctive constraint sets and its applications to optimization problems
- On the linear independence constraint qualification in disjunctive programming
- Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control
- On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function
Uses Software
This page was built for publication: Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018769)
