Sparse Switching Times Optimization and a Sweeping Hessian Proximal Method

Alberto De Marchi () and Matthias Gerdts ()
Additional contact information
Alberto De Marchi: Universität der Bundeswehr München
Matthias Gerdts: Universität der Bundeswehr München

A chapter in Operations Research Proceedings 2019, 2020, pp 89-95 from Springer

Abstract: Abstract The switching times optimization problem for switched dynamical systems, with fixed initial state, is considered. A nonnegative cost term for changing dynamics is introduced to induce a sparse switching structure, that is, to reduce the number of switches. To deal with such problems, an inexact Newton-type arc search proximal method, based on a parametric local quadratic model of the cost function, is proposed. Numerical investigations and comparisons on a small-scale benchmark problem are presented and discussed.

Keywords: Switched dynamical systems; Switching time optimization; Sparse optimization; Cardinality; Proximal methods; 90C26; 90C53; 49M27 (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-48439-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9783030484392

DOI: 10.1007/978-3-030-48439-2_11

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().