Nondifferentiable optimization algorithm for designing control systems having singular value inequalities

DOI10.1016/0005-1098(82)90087-5zbMath0532.49017OpenAlexW1993433915MaRDI QIDQ788989

N. E. Zubov

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

zbMATH Keywords

frequency responsesingular value inequalitiescomputer-aided system designdecomposition nondifferentiable algorithm

Mathematics Subject Classification ID

Related Items (40)

On minimax eigenvalue problems via constrained optimization ⋮ A stochastic algorithm for optimization problems with continua of inequalities ⋮ The bundle scheme for solving arbitrary eigenvalue optimizations ⋮ On minimizing the largest eigenvalue of a symmetric matrix ⋮ An application-oriented, optimization-based methodology for interactive design of engineering systems† ⋮ Alternative algorithms for solving nonlinear function and functional inequalities ⋮ A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations ⋮ On the need for special purpose algorithms for minimax eigenvalue problems ⋮ An IQC for uncertainty satisfying both norm-bounded and passivity constraints ⋮ Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization ⋮ Modelling and optimal control for an impulsive dynamical system in microbial fed-batch culture ⋮ Nonsmooth optimization for multiband frequency domain control design ⋮ Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates ⋮ Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints† ⋮ Nondifferentiable design optimization problems with application to control engineering ⋮ Systematic design of robust control systems using small gain stability concepts ⋮ Second-order nonsmooth optimization for \(H_{\infty}\) synthesis ⋮ An observer-based decentralized tracker for sampled-data systems: an evolutionary programming approach ⋮ When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter? ⋮ Graph Lyapunov function for switching stabilization and distributed computation ⋮ Convergence rate for an approximation approach to \(H_ \infty\)-norm optimization problems with an application to controller order reduction ⋮ A fast space-decomposition scheme for nonconvex eigenvalue optimization ⋮ Modeling and optimal control of a nonlinear dynamical system in microbial fed-batch fermentation ⋮ Hard problems in linear control theory: possible approaches to their solution ⋮ Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values ⋮ Local convergence of an augmented Lagrangian method for matrix inequality constrained programming ⋮ Robust eigenstructure clustering by non-smooth optimisation ⋮ Nonsmooth optimization for multidisk \(H_\infty\) synthesis ⋮ A new computational algorithm for functional inequality constrained optimization problems ⋮ Method of centers for minimizing generalized eigenvalues ⋮ A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix ⋮ A computational algorithm for functional inequality constrained optimization problems ⋮ Sequential parametric convex approximation algorithm for bilinear matrix inequality problem ⋮ A direct method of linearization for continuous minimax problems ⋮ Nonlinear dynamical systems of fed-batch fermentation and their optimal control ⋮ 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 ⋮ Semidefinite programming ⋮ Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form

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

This page was built for publication: Nondifferentiable optimization algorithm for designing control systems having singular value inequalities