Computational approaches for mixed integer optimal control problems with indicator constraints
From MaRDI portal
Publication:1633792
DOI10.1007/s10013-018-0313-zzbMath1405.49002OpenAlexW2894999237WikidataQ129162703 ScholiaQ129162703MaRDI QIDQ1633792
Susanne Sass, Christian Kirches, Michael N. Jung, Sebastian Sager
Publication date: 20 December 2018
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-018-0313-z
dynamic programmingswitched systemsMINLPmixed integer optimal controlswitching functionvanishing constraintscruise controlheavy-duty truckindicator constraintspartial outer convexification
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Multiphase mixed-integer nonlinear optimal control of hybrid electric vehicles ⋮ Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control ⋮ Approximation properties of sum-up rounding in the presence of vanishing constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- The integer approximation error in mixed-integer optimal control
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Combinatorial integral approximation
- TACO: a toolkit for AMPL control optimization
- Optimal control for continuous supply network models
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- A perspective-based convex relaxation for switched-affine optimal control
- Modal occupation measures and LMI relaxations for nonlinear switched systems control
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- Reformulation: nonsmooth, piecewise smooth, semismooth and smoothing methods. Session in the 16th international symposium on Mathematical programming (ismp97) held at Lausanne EPFL, Switzerland, August 24--29, 1997
- A smoothing method for mathematical programs with equilibrium constraints
- Generating convex polynomial inequalities for mixed 0-1 programs
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Convex programming for disjunctive convex optimization
- Mathematical programs with blocks of vanishing constraints arising in discretized mixed-integer optimal control problems
- Efficient upper and lower bounds for global mixed-integer optimal control
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Optimal control for traffic flow networks
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- A pivoting algorithm for linear programming with linear complementarity constraints
- Evaluating Gas Network Capacities
- The Lagrangian relaxation for the combinatorial integral approximation problem
- Time-optimal control of automobile test drives with gear shifts
- Nonlinear Programming Techniques for Operative Planning in Large Drinking Water Networks
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Nonconvex Structures in Nonlinear Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Numerical solution of optimal control problems with explicit and implicit switches
- Some properties of regularization and penalization schemes for MPECs
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
- On Perspective Functions and Vanishing Constraints in Mixed-Integer Nonlinear Optimal Control
- Mixed-integer nonlinear optimization
- Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
- Chapter 9: Mixed-Integer DAE Optimal Control Problems: Necessary Conditions and Bounds
- The theory of dynamic programming
This page was built for publication: Computational approaches for mixed integer optimal control problems with indicator constraints
