A nonsmooth optimization approach to H-infinity synthesis
- Authors: Mammadov, Musa , Orsi, Robert
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the 44th IEEE Conference on Decision and Control and European Control Conference ECC 2005, Seville, Sp[ain, 12-15 December 2005, Seville, Spain : 12th - 15th December, 2005
- Full Text: false
- Reviewed:
- Description: A numerical method for solving the H∞ synthesis problem is presented. The problem is posed as an unconstrained, nonsmooth, nonconvex minimization problem. The optimization variables consist solely of the entries of the output feedback matrix. No additional variables, such as Lyapunov variables, need to be introduced. The optimization procedure uses a line search mechanism where the descent direction is defined by a recently introduced dynamical systems approach. Numerical results for various benchmark problems are included.
- Description: E1
- Description: 2003001386
Approximation of the optimal control problem with the nonsmooth state constraints
- Authors: Dymkou, Siarhei
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Symposium on the Industrial Optimisation and the 9th Australian Optimisation Day, Perth : 30th October, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000466
Parallelization of the discrete gradient method of non-smooth optimization and its applications
- Authors: Beliakov, Gleb , Tobon, Monsalve , Bagirov, Adil
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at Computational Science ICCS 2003 Conference, Melbourne : 2nd June, 2003
- Full Text: false
- Reviewed:
- Description: We investigate parallelization and performance of the discrete gradient method of nonsmooth optimization. This derivative free method is shown to be an effective optimization tool, able to skip many shallow local minima of nonconvex nondifferentiable objective functions. Although this is a sequential iterative method, we were able to parallelize critical steps of the algorithm, and this lead to a significant improvement in performance on multiprocessor computer clusters. We applied this method to a difficult polyatomic clusters problem in computational chemistry, and found this method to outperform other algorithms.
- Description: E1
- Description: 2003000435