On the computation of sparse solutions to the controllability problem for discrete-time linear systems

DOI10.1007/s10957-019-01532-9zbMath1425.49019OpenAlexW2941719609WikidataQ127961933 ScholiaQ127961933MaRDI QIDQ2275285

Efstathios Bakolas

Publication date: 2 October 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-019-01532-9

zbMATH Keywords

discrete-time linear systemscompressive sensingsparse controliterative least squares algorithmlinearized impulsive minimum fuel control

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Linear optimal control problems (49N05)

Related Items (1)

Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints

Cites Work

• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• A new mixed iterative algorithm to solve the fuel-optimal linear impulsive rendezvous problem
• Testing the nullspace property using semidefinite programming
• Linearized impulsive rendezvous problem
• Maximum Hands-Off Control: A Paradigm of Control Effort Minimization
• Decoding by Linear Programming
• Iteratively reweighted least squares minimization for sparse recovery
• Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
• Optimization, a Moment Problem, and Nonlinear Programming
• Quadratic Model Predictive Control Including Input Cardinality Constraints
• Primer vector on fixed-time impulsive trajectories.
• Optimal four-impulse fixed-time rendezvous in the vicinity of a circular orbit.

This page was built for publication: On the computation of sparse solutions to the controllability problem for discrete-time linear systems