Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
computer-aided system designdecomposition nondifferentiable algorithmfrequency responsesingular value inequalities
Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Decomposition methods (49M27) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Transformations (93B17) Synthesis problems (93B50) Multivariable systems, multidimensional control systems (93C35)
A decomposition nondifferentiable algorithm is proposed for the optimization problem f(x)\(\to \min\) subject to the constraints \(g^ j(x)\leq 0\), \(j=1,...,m_ g\); \(\max_{t\in T}h^ k(x,t)\leq 0\), \(k=1,...,m_ h\) and \(p_ j(\omega)\leq s^ i_ j(x,\omega)\leq q_ j(\omega),\quad i=1,...,m,\quad j=1,...,L,\quad \omega \in \Omega.\) Here f(.), \(g^ j(.)\), \(h^ k(.,.)\) are differentiable and \(p_ j(.)\), q(.) are continuous functions. The numbers \(s^ i_ j(x,\omega)\) are the singular values of an \(m\times m\) complex valued transfer matrix \(G_ j(x,\omega)\) and \(\Omega\) is a frequency interval. The algorithm itself is demonstrated on the simpler case f(x)\(\to \min\), \(p(\omega)\leq s^ i(x,\omega)\leq q(\omega),\quad i=1,...,m,\quad \omega \in \Omega,\) where \(s^ i(x,\omega)\) are the singular values of a single matrix. The decomposition technique reduces the last problem to a sequence of problems in which \(\omega\) varies over a finite subset of \(\Omega\).
- A linearization algorithm for optimizing control systems subject to singular value inequalities
- Nondifferentiable design optimization problems with application to control engineering
- scientific article; zbMATH DE number 433011
- A constrained H∞ smooth optimization technique
- Conditions for Optimality over $H^\infty $
- Algorithms for a class of computer-aided design problems: A review
- Algorithms for the design of control systems subject to singular value inequalities
- An Algorithm for Constrained Optimization with Semismooth Functions
- An improved algorithm for optimization problems with functional inequality constraints
- An inequality and some computations related to the robust stability of linear dynamic systems
- An outer approximations algorithm for computer-aided design problems
- Combined phase I—phase II methods of feasible directions
- Design of multivariable feedback systems with stable plant
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- Generalized Gradients and Applications
- scientific article; zbMATH DE number 3668430 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3789375 (Why is no real title available?)
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 3496814 (Why is no real title available?)
- scientific article; zbMATH DE number 3554030 (Why is no real title available?)
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- scientific article; zbMATH DE number 3200675 (Why is no real title available?)
- scientific article; zbMATH DE number 3082776 (Why is no real title available?)
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- On the solution of singular value inequalities over a continuum of frequencies
- Robust stability of systems with application to singular perturbations
- Singular value decomposition and least squares solutions
- Sufficient conditions for extremum, penalty functions and regularity
- On minimax eigenvalue problems via constrained optimization
- A stochastic algorithm for optimization problems with continua of inequalities
- On the need for special purpose algorithms for minimax eigenvalue problems
- When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter?
- Convergence rate for an approximation approach to \(H_ \infty\)-norm optimization problems with an application to controller order reduction
- Method of centers for minimizing generalized eigenvalues
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form
- On minimizing the largest eigenvalue of a symmetric matrix
- An IQC for uncertainty satisfying both norm-bounded and passivity constraints
- Semidefinite programming
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- A new computational algorithm for functional inequality constrained optimization problems
- A direct method of linearization for continuous minimax problems
- Graph Lyapunov function for switching stabilization and distributed computation
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
- Second-order nonsmooth optimization for \(H_{\infty}\) synthesis
- Hard problems in linear control theory: possible approaches to their solution
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- A globally convergent method for solving nonlinear equations without the differentiability condition
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- The bundle scheme for solving arbitrary eigenvalue optimizations
- Alternative algorithms for solving nonlinear function and functional inequalities
- Robust eigenstructure clustering by non-smooth optimisation
- scientific article; zbMATH DE number 433011 (Why is no real title available?)
- A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
- Modelling and optimal control for an impulsive dynamical system in microbial fed-batch culture
- An application-oriented, optimization-based methodology for interactive design of engineering systems†
- A linearization algorithm for optimizing control systems subject to singular value inequalities
- Systematic design of robust control systems using small gain stability concepts
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
- Nondifferentiable design optimization problems with application to control engineering
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Modeling and optimal control of a nonlinear dynamical system in microbial fed-batch fermentation
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- Nonlinear dynamical systems of fed-batch fermentation and their optimal control
- An observer-based decentralized tracker for sampled-data systems: an evolutionary programming approach
- Bundle method for non-convex minimization with inexact subgradients and function values
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
- Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
- A computational algorithm for functional inequality constrained optimization problems
- Nonsmooth optimization for multiband frequency domain control design
This page was built for publication: Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788989)
