Sparse switching times optimization and a sweeping Hessian proximal method

DOI10.1007/978-3-030-48439-2_11zbMath1476.90253OpenAlexW3089309656MaRDI QIDQ2050247

Alberto De Marchi, Matthias Gerdts

Publication date: 30 August 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-48439-2_11

zbMATH Keywords

cardinalityproximal methodssparse optimizationswitching time optimizationswitched dynamical systems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53) Decomposition methods (49M27)

Related Items (2)

Sequential linear integer programming for integer optimal control with total variation regularization ⋮ On Integer Optimal Control with Total Variation Regularization on Multidimensional Domains

This page was built for publication: Sparse switching times optimization and a sweeping Hessian proximal method