Search results for "lower bounds"
showing 10 items of 259 documents
Analytic Exact Upper Bound for the Lyapunov Dimension of the Shimizu–Morioka System
2015
In applied investigations, the invariance of the Lyapunov dimension under a diffeomorphism is often used. However, in the case of irregular linearization, this fact was not strictly considered in the classical works. In the present work, the invariance of the Lyapunov dimension under diffeomorphism is demonstrated in the general case. This fact is used to obtain the analytic exact upper bound of the Lyapunov dimension of an attractor of the Shimizu–Morioka system. peerReviewed
Adaptive neural state-feedback stabilizing controller for nonlinear systems with mismatched uncertainty
2014
In this paper, an adaptive neural network (NN) state-feedback controller for a class of nonlinear systems with mismatched uncertainties is presented. By using a radial basis (RBF) neural network, a bound of unknown nonlinear functions is approximated so that no information about the upper bound of mismatched uncertainties is required. The state-feedback is based on Lyapunov stability theory, and it is shown that the asymptotic convergence of the closed-loop system to zero is achieved while maintaining bounded states at the same time. The presented methods are more general than the previous approaches, handling systems with no restriction on the dimension of the system and the number of inpu…
Controlling risk through diversification in portfolio selection with non-historical information
2017
We deal with the portfolio selection problem for investors having information on the expected returns of the assets based not only on historical data. In the absence of a way of measuring the risk of non-historical information, the investor may try to adjust it through the consideration of a suitable set of diversification constraints. With this aim, we relate the concept of value of information (recently introduced by Kao and Steuer) to a qualitative subjective measure of the investor’s level of confidence in his/her non-historical information. As an illustration, we analyze the behavior of the proposed indicator in the Spanish IBEX35 index for risk, upper bound, semicontinuous variable an…
Optimality conditions for shakedown design of trusses
1995
This paper deals with optimal shakedown design of truss structures constituted by elastic perfectly plastic material. The design problem is formulated by means of a statical approach on the grounds of the shakedown lower bound theorem, and by means of a kinematical approach on the grounds of the shakedown upper bound theorem. In both cases two different types of design problem are formulated: one searches for the minimum volume design whose shakedown limit load is assigned; the other searches for the maximum shakedown limit load design whose volume is assigned. The Kuhn-Tucker equations of the four problems here above mentioned are found by utilizing a variational approach; these equations …
Learning for allocations in the long-run average core of dynamical cooperative TU games
2011
We consider repeated coalitional TU games characterized by unknown but bounded and time-varying coalitions' values. We build upon the assumption that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to learn on how to re-adjust the allocations among the players. As main result, we present an allocation rule based on the extra reward variable that converges with probability one to the core of the long-run average game. Analogies with stochastic stability theory are put in evidence.
Optimal Guaranteed Cost Control of a Class of Discrete-Time Nonlinear Systems with Markovian Switching and Mode-Dependent Mixed Time Delays
2013
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/653628 Open Access The guaranteed cost control problem is investigated for a class of nonlinear discrete-time systems with Markovian jumping parameters and mixed time delays. The mixed time delays involved consist of both the mode-dependent discrete delay and the distributed delay with mode-dependent lower bound. The associated cost function is of a quadratic summation form over the infinite horizon. The nonlinear functions are assumed to satisfy sector-bounded conditions. By introducing new Lyapunov-Krasovskii functionals and developing some ne…
Error Estimates for a Class of Elliptic Optimal Control Problems
2016
In this article, functional type a posteriori error estimates are presented for a certain class of optimal control problems with elliptic partial differential equation constraints. It is assumed that in the cost functional the state is measured in terms of the energy norm generated by the state equation. The functional a posteriori error estimates developed by Repin in the late 1990s are applied to estimate the cost function value from both sides without requiring the exact solution of the state equation. Moreover, a lower bound for the minimal cost functional value is derived. A meaningful error quantity coinciding with the gap between the cost functional values of an arbitrary admissible …
Robust control for autonomous spacecraft evacuation with model uncertainty and upper bound of performance with constraints
2014
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/589381 This paper studies the problem of guaranteed cost control for spacecraft evacuation. The relative dynamic model is established based on Clohessy-Wiltshire (C-W) equations. The paper has taken parameter uncertainty, output tracking, disturbance attenuation, and fuel cost into consideration. The paper introduces a new Lyapunov approach, so the controller design problem can be transferred into a convex optimization problem subject to linear matrix inequality (LMI) constraints. By using the controller, the spacecraft evacuation can be …
A cutting plane algorithm for the capacitated arc routing problem
2003
The Capacitated Arc Routing Problem (CARP) consists of finding a set of minimum cost routes that service all the positive-demand edges of a given graph, subject to capacity restrictions.In this paper, we introduce some new valid inequalities for the CARP. We have designed and implemented a cutting plane algorithm for this problem based on these new inequalities and some other which were already known. Several identification algorithms have been developed for all these valid inequalities. This cutting plane algorithm has been applied to three sets of instances taken from the literature as well as to a new set of instances with real data, and the resulting lower bound was optimal in 47 out of…
A branch and bound algorithm for the maximum diversity problem
2010
This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger set in such a way that the sum of the distances between the chosen elements is maximized. We propose a branch and bound algorithm and develop several upper bounds on the objective function values of partial solutions to the MDP. Empirical results with a collection of previously reported instances indicate that the proposed algorithm is able to solve all the medium-sized instances (with 50 elements) as well as some large-sized instances (with 100 elements). We compare our method with the best previous line…