All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 26 Next

Displaying 501 – 520 of 612

Showing per page

An H ∞ sliding mode observer for Takagi-Sugeno nonlinear systems with simultaneous actuator and sensor faults

Ali Ben Brahim, Slim Dhahri, Fayçal Ben Hmida, Anis Sellami (2015)

International Journal of Applied Mathematics and Computer Science

This paper considers the problem of robust reconstruction of simultaneous actuator and sensor faults for a class of uncertain Takagi-Sugeno nonlinear systems with unmeasurable premise variables. The proposed fault reconstruction and estimation design method with H∞ performance is used to reconstruct both actuator and sensor faults when the latter are transformed into pseudo-actuator faults by introducing a simple filter. The main contribution is to develop a sliding mode observer (SMO) with two...

An idempotent algorithm for a class of network-disruption games

William M. McEneaney, Amit Pandey (2016)

Kybernetika

A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...

An imperfect conjugate gradient algorithm

Fridrich Sloboda (1982)

Aplikace matematiky

A new biorthogonalization algorithm is defined which does not depend on the step-size used. The algorithm is suggested so as to minimize the total error after n steps if imperfect steps are used. The majority of conjugate gradient algorithms are sensitive to the exactness of the line searches and this phenomenon may destroy the global efficiency of these algorithms.

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an independent...

An improved nonmonotone adaptive trust region method

Yanqin Xue, Hongwei Liu, Zexian Liu (2019)

Applications of Mathematics

Trust region methods are a class of effective iterative schemes in numerical optimization. In this paper, a new improved nonmonotone adaptive trust region method for solving unconstrained optimization problems is proposed. We construct an approximate model where the approximation to Hessian matrix is updated by the scaled memoryless BFGS update formula, and incorporate a nonmonotone technique with the new proposed adaptive trust region radius. The new ratio to adjusting the next trust region radius...

An infinite horizon predictive control algorithm based on multivariable input-output models

Maciej Ławryńczuk, Piotr Tatjewski (2004)

International Journal of Applied Mathematics and Computer Science

In this paper an infinite horizon predictive control algorithm, for which closed loop stability is guaranteed, is developed in the framework of multivariable linear input-output models. The original infinite dimensional optimisation problem is transformed into a finite dimensional one with a penalty term. In the unconstrained case the stabilising control law, using a numerically reliable SVD decomposition, is derived as an analytical formula, calculated off-line. Considering constraints needs solving...

An instantaneous semi-Lagrangian approach for boundary control of a melting problem

Youness Mezzan, Moulay Hicham Tber (2021)

Applications of Mathematics

In this paper, a sub-optimal boundary control strategy for a free boundary problem is investigated. The model is described by a non-smooth convection-diffusion equation. The control problem is addressed by an instantaneous strategy based on the characteristics method. The resulting time independent control problems are formulated as function space optimization problems with complementarity constraints. At each time step, the existence of an optimal solution is proved and first-order optimality conditions...

An interior point algorithm for convex quadratic programming with strict equilibrium constraints

Rachid Benouahboun, Abdelatif Mansouri (2005)

RAIRO - Operations Research - Recherche Opérationnelle

We describe an interior point algorithm for convex quadratic problem with a strict complementarity constraints. We show that under some assumptions the approach requires a total of O ( n L ) number of iterations, where L is the input size of the problem. The algorithm generates a sequence of problems, each of which is approximately solved by Newton’s method.

An interior point algorithm for convex quadratic programming with strict equilibrium constraints

Rachid Benouahboun, Abdelatif Mansouri (2010)

RAIRO - Operations Research

We describe an interior point algorithm for convex quadratic problem with a strict complementarity constraints. We show that under some assumptions the approach requires a total of O ( n L ) number of iterations, where L is the input size of the problem. The algorithm generates a sequence of problems, each of which is approximately solved by Newton's method.

An interior-point algorithm for semidefinite least-squares problems

Chafia Daili, Mohamed Achache (2022)

Applications of Mathematics

We propose a feasible primal-dual path-following interior-point algorithm for semidefinite least squares problems (SDLS). At each iteration, the algorithm uses only full Nesterov-Todd steps with the advantage that no line search is required. Under new appropriate choices of the parameter β which defines the size of the neighborhood of the central-path and of the parameter θ which determines the rate of decrease of the barrier parameter, we show that the proposed algorithm is well defined and converges...

An iterative algorithm for computing the cycle mean of a Toeplitz matrix in special form

Peter Szabó (2013)

Kybernetika

The paper presents an iterative algorithm for computing the maximum cycle mean (or eigenvalue) of n × n triangular Toeplitz matrix in max-plus algebra. The problem is solved by an iterative algorithm which is applied to special cycles. These cycles of triangular Toeplitz matrices are characterized by sub-partitions of n - 1 .

Currently displaying 501 – 520 of 612