Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
From MaRDI portal
Publication:788989
DOI10.1016/0005-1098(82)90087-5zbMath0532.49017MaRDI QIDQ788989
Publication date: 1982
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(82)90087-5
frequency response; singular value inequalities; computer-aided system design; decomposition nondifferentiable algorithm
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
93C35: Multivariable systems, multidimensional control systems
93B17: Transformations
93B50: Synthesis problems
15A42: Inequalities involving eigenvalues and eigenvectors
15A18: Eigenvalues, singular values, and eigenvectors
49M27: Decomposition methods
Related Items
Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†, Nondifferentiable design optimization problems with application to control engineering, An observer-based decentralized tracker for sampled-data systems: an evolutionary programming approach, A computational algorithm for functional inequality constrained optimization problems, Nonsmooth optimization for multiband frequency domain control design, 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, A new computational algorithm for functional inequality constrained optimization problems, A direct method of linearization for continuous minimax problems, Hard problems in linear control theory: possible approaches to their solution, 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, Alternative algorithms for solving nonlinear function and functional inequalities, An application-oriented, optimization-based methodology for interactive design of engineering systems†, Systematic design of robust control systems using small gain stability concepts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An outer approximations algorithm for computer-aided design problems
- Robust stability of systems with application to singular perturbations
- Algorithms for a class of computer-aided design problems: A review
- Singular value decomposition and least squares solutions
- An improved algorithm for optimization problems with functional inequality constraints
- Design of multivariable feedback systems with stable plant
- On the solution of singular value inequalities over a continuum of frequencies
- Algorithms for the design of control systems subject to singular value inequalities
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Generalized Gradients and Applications
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- An Algorithm for Constrained Optimization with Semismooth Functions
- An inequality and some computations related to the robust stability of linear dynamic systems
- Combined phase I—phase II methods of feasible directions
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- Sufficient conditions for extremum, penalty functions and regularity
