Nondifferentiable optimization algorithm for designing control systems having singular value inequalities

doi:10.1016/0005-1098(82)90087-5

Automatica

Volume 18, Issue 3, May 1982, Pages 267-283

https://doi.org/10.1016/0005-1098(82)90087-5 Get rights and content

Abstract

It has been known for some time that many control system design requirements can be expressed as differentiable inequalities. More recently, it has been shown that important structural properties such as robustness and low noise sensitivity can be expressed as nondifferentiable inequalities involving the singular values of a system or return difference transfer function matrix. This paper presents an optimization algorithm which permits all these constraints to be considered.

References (33)

Ahlfors
R. Bellman
C. Berge
F.H. Clarke
Generalized gradients and applications
Trans. Am. Math. Soc.
(1975)
J. Cullum et al.
The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
Math. Prog. Study
(1975)
C.A. Desoer et al.
Design of multivariable control systems with stable plant
J.C. Doyle
Robustness of multiloop linear feedback systems
G. Golub et al.
Singular value decomposition and least square solutions
Num. Math.
(1970)
C. Gonzaga et al.
On constraint dropping schemes and optimality functions for a class of outer approximations algorithms
Siam J. Contr. and Optimization
(1979)
E. Gonzaga et al.
An improved algorithm for optimization problems with functional inequality constraints
IEEE Trans Aut. Control
(1979)

A.J. Laub

Linear multivariable control: numerical considerations

A.J. Laub

An inequality and some computations related to the robust stability of linear dynamic systems

IEEE Trans Aut. Contr

(1979)

G. Lebourg

Valeur moyenne pour gradient generalise

C. R. Acad. Sci., Paris

(1975)

C. Lemarechal

An extension of Davidon methods to nondifferentiable problems

D.Q. Mayne et al.

Algorithms for the design of control systems subject to singular value inequalities

Cited by (101)

Graph Lyapunov function for switching stabilization and distributed computation
2020, Automatica
This paper studies stabilization of discrete-time switched linear systems (SLSs) using the notion of graph control Lyapunov functions (GCLFs). A GCLF is a set of Lyapunov functions defined on a weighted digraph, where each Lyapunov function is represented by a node in the digraph and there is a Lyapunov inequality associated with each subgraph consisting of a node and its out-neighbors. The weight of a directed edge indicates the decay or growth rate of the Lyapunov functions. It is proved that an SLS is switching stabilizable if and only if there exists a GCLF. The main benefits of GCLFs are reduced computational cost and conservatism for stabilizability tests. Besides, we show that the proposed GCLF framework unifies several control Lyapunov functions and the related stabilization theorems. Moreover, we propose a distributed algorithm to evaluate the stabilizability with reduced computational costs by taking benefits of the graph structure of GCLFs. Several examples are given to demonstrate the efficiency of the algorithm.
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
2015, Applied Mathematics and Computation
Citation Excerpt :
Eigenvalue optimization problems became an independent area of research with both theoretical and practical aspects in 1980s [26,38–40]. Early contributions owe to [9,13,43,48]. The problems enjoy great importance in physics, engineering, statistics, and finance; see, e.g., experimental design [47], optimal system design [4,35], shape optimization [10], relaxations of combinatorial optimization problems [20,27].
We present a proximal bundle method for minimizing the nonconvex maximum eigenvalue function based on a real time control system. The oracle used in our proximal bundle method is able to compute separately the value and subgradient of the outer convex function. Besides, it can also calculate the value and derivatives of the smooth inner mapping. In each iteration, we solve a certain quadratic programming problem in which the smooth inner mapping is replaced by its Taylor-series linearization around the current serious step. By using the backtracking test, we can make a better approximation of the objective function. With no additional assumption, we prove the global convergence of our special bundle method. We present numerical examples demonstrating the efficiency of our algorithm on several feedback control syntheses.
Modeling and optimal control of a nonlinear dynamical system in microbial fed-batch fermentation
2011, Mathematical and Computer Modelling
Citation Excerpt :
(OCM) is essentially an optimization problem subject to continuous state constraints. Several successful families of algorithms for solving this class of problems have been developed [25,28–32]. In particular, we would like to mention a computational approach base on a constraint transcription and local smoothing technique in [25].
The mathematical model and optimal control of microbial fed-batch fermentation is considered in this paper. Since it is decisive for increasing the productivity of 1,3-propanediol (1,3-PD) to optimize the feeding rate of glycerol and the switching instants between the batch and feeding processes in the fermentation process, we propose a new nonlinear dynamical system to formulate the process. In the system, the switching instants are variable and the feed rate of glycerol is regarded as the control function. Some important properties of the proposed system and its solution are then discussed. To maximize the concentration of 1,3-PD at the terminal time, an optimal control model involving the proposed system and subject to continuous state inequality constraints is established. The existence of the optimal control of the model is also proved. Finally, a computational approach is constructed on the basis of constraint transcription and smoothing approximation techniques. Numerical results show that the concentration of 1,3-PD at the terminal time can be increased considerably.
REVISITING SPECTRAL BUNDLE METHODS: PRIMAL-DUAL (SUB)LINEAR CONVERGENCE RATES
2023, SIAM Journal on Optimization
Stabilization problems with constraints: Analysis and computational aspects
2021, Stabilization Problems with Constraints: Analysis and Computational Aspects
Revisiting Spectral Bundle Methods: Primal-dual (Sub)linear Convergence Rates
2020, arXiv

View all citing articles on Scopus

^☆: The original version of this paper was presented at the 8th IFAC Congress on Control Science and Technology for the Progress of Society, which was held in Kyoto, Japan during August 1981. The published proceedings of this IFAC meeting may be ordered from Pergamon Press Ltd., Headington Hill Hall, Oxford OX3 0BW, U.K. This paper was recommended for publication in revised form by associate editor D. Jacobson.

View full text

Nondifferentiable optimization algorithm for designing control systems having singular value inequalities☆

Abstract

Generalized gradients and applications

Trans. Am. Math. Soc.

The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices

Math. Prog. Study

Design of multivariable control systems with stable plant

Robustness of multiloop linear feedback systems

Singular value decomposition and least square solutions

Num. Math.

On constraint dropping schemes and optimality functions for a class of outer approximations algorithms

Siam J. Contr. and Optimization

An improved algorithm for optimization problems with functional inequality constraints

IEEE Trans Aut. Control