Page 1

Displaying 1 – 7 of 7

Showing per page

Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints

Abdelkrim El Mouatasim, Rachid Ellaia, Eduardo Souza de Cursi (2011)

International Journal of Applied Mathematics and Computer Science

We present a random perturbation of the projected variable metric method for solving linearly constrained nonsmooth (i.e., nondifferentiable) nonconvex optimization problems, and we establish the convergence to a global minimum for a locally Lipschitz continuous objective function which may be nondifferentiable on a countable set of points. Numerical results show the effectiveness of the proposed approach.

Receding horizon optimal control for infinite dimensional systems

Kazufumi Ito, Karl Kunisch (2002)

ESAIM: Control, Optimisation and Calculus of Variations

The receding horizon control strategy for dynamical systems posed in infinite dimensional spaces is analysed. Its stabilising property is verified provided control Lyapunov functionals are used as terminal penalty functions. For closed loop dissipative systems the terminal penalty can be chosen as quadratic functional. Applications to the Navier–Stokes equations, semilinear wave equations and reaction diffusion systems are given.

Receding horizon optimal control for infinite dimensional systems

Kazufumi Ito, Karl Kunisch (2010)

ESAIM: Control, Optimisation and Calculus of Variations

The receding horizon control strategy for dynamical systems posed in infinite dimensional spaces is analysed. Its stabilising property is verified provided control Lyapunov functionals are used as terminal penalty functions. For closed loop dissipative systems the terminal penalty can be chosen as quadratic functional. Applications to the Navier–Stokes equations, semilinear wave equations and reaction diffusion systems are given.

Recursive form of general limited memory variable metric methods

Ladislav Lukšan, Jan Vlček (2013)

Kybernetika

In this report we propose a new recursive matrix formulation of limited memory variable metric methods. This approach can be used for an arbitrary update from the Broyden class (and some other updates) and also for the approximation of both the Hessian matrix and its inverse. The new recursive formulation requires approximately 4 m n multiplications and additions per iteration, so it is comparable with other efficient limited memory variable metric methods. Numerical experiments concerning Algorithm...

Currently displaying 1 – 7 of 7

Page 1