Parametric variational solution of linear-quadratic optimal control problems with control inequality constraints

A parametric variational principle and the corresponding numerical algo- rithm are proposed to solve a linear-quadratic （LQ） optimal control problem with control inequality constraints. Based on the parametric variational principle, this control prob- lem is transformed into a set of Hamiltonian canonical equations coupled with the linear complementarity equations, which are solved by a linear complementarity solver in the discrete-time domain. The costate variable information is also evaluated by the proposed method. The parametric variational algorithm proposed in this paper is suitable for both time-invariant and time-varying systems. Two numerical examples are used to test the validity of the proposed method. The proposed algorithm is used to astrodynamics to solve a practical optimal control problem for rendezvousing spacecrafts with a finite low thrust. The numerical simulations show that the parametric variational algorithm is ef- fective for LQ optimal control problems with control inequality constraints.

Linear matrix inequality approach to exponential synchronization of a class of chaotic neural networks with time-varying delays

In this paper, a synchronization scheme for a class of chaotic neural networks with time-varying delays is presented. This class of chaotic neural networks covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks, and bidirectional associative memory networks. The obtained criteria are expressed in terms of linear matrix inequalities, thus they can be efficiently verified. A comparison between our results and the previous results shows that our results are less restrictive.

Inertial Subgradient Extragradient Algorithm for Solving Variational Inequality Problems with Pseudomonotonicity

In order to solve variational inequality problems of pseudomonotonicity and Lipschitz continuity in Hilbert spaces, an inertial subgradient extragradient algorithm is proposed by virtue of non-monotone stepsizes. Moreover, weak convergence and R-linear convergence analyses of the algorithm are constructed under appropriate assumptions. Finally, the efficiency of the proposed algorithm is demonstrated through numerical implementations.

On stabilization for a class of nonlinear stochastic time-delay systems:a matrix inequality approach

This paper treats the feedback stabilization of nonlinear stochastic time-delay systems with state and control-dependent noise. Some locally （globally） robustly stabilizable conditions are given in terms of matrix inequalities that are independent of the delay size. When it is applied to linear stochastic time-delay systems, sufficient conditions for the state-feedback stabilization are presented via linear matrix inequalities. Several previous results are extended to more general systems with both state and control-dependent noise, and easy computation algorithms are also given.

Linear matrix inequality approach for synchronization control of fuzzy cellular neural networks with mixed time delays

Fuzzy cellular neural networks （FCNNs） are special kinds of cellular neural networks （CNNs）. Each cell in an FCNN contains fuzzy operating abilities. The entire network is governed by cellular computing laws. The design of FCNNs is based on fuzzy local rules. In this paper, a linear matrix inequality （LMI） approach for synchronization control of FCNNs with mixed delays is investigated. Mixed delays include discrete time-varying delays and unbounded distributed delays. A dynamic control scheme is proposed to achieve the synchronization between a drive network and a response network. By constructing the Lyapunov-Krasovskii functional which contains a triple-integral term and the free-weighting matrices method an improved delay-dependent stability criterion is derived in terms of LMIs. The controller can be easily obtained by solving the derived LMIs. A numerical example and its simulations are presented to illustrate the effectiveness of the proposed method.

Linear matrix inequality approach for robust stability analysis for stochastic neural networks with time-varying delay

This paper studies the problem of linear matrix inequality （LMI） approach to robust stability analysis for stochastic neural networks with a time-varying delay. By developing a delay decomposition approach, the information of the delayed plant states can be taken into full consideration. Based on the new Lyapunov-Krasovskii functional, some inequality techniques and stochastic stability theory, new delay-dependent stability criteria are obtained in terms of LMIs. The proposed results prove the less conservatism, which are realized by choosing new Lyapunov matrices in the decomposed integral intervals. Finally, numerical examples are provided to demonstrate the less conservatism and effectiveness of the proposed LMI method.

A CLASS OF TRUST REGION METHODS FOR LINEAR INEQUALITY CONSTRAINED OPTIMIZATION AND ITS THEORY ANALYSIS：I．ALGORITHM AND GLOBAL CONVERGENCE

A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided projection and the strategy of the unconstrained trust region methods. It keeps the good convergence properties of the unconstrained case and has the merits of the projection method. In some sense, our algorithm can be regarded as an extension and improvement of the projected type algorithm.

A CLASS OF TRUST REGION METHODS FOR LINEAR INEQUALITY CONSTRAINED OPTIMIZATION AND ITS THEORY ANALYSIS Ⅱ．LOCAL CONVERGENCE RATE AND NUMERICAL TESTS

In this paper we prove that a class of trust region methods presented in part I is superlinearly convergent. Numerical tests are reported thereafter. Results by solving a set of typical problems selected from literatures have demonstrated that our algorithm is effective.

HARDY-LITTLEWOOD-POLYA INEQUALITY FOR A LINEAR DIFFERENTIAL OPERATOR AND SOME RELATED OPTIMAL PROBLEMS

In this paper a generalized version of the classical Hardy-Littlewood-Polya inequality is given.Furthermore,the Stechkin's problem for a linear differential operator is solved in L_2(R), and the optimal recovery problem for such differential operator is considered.

An Existent Condition of Error Bounds for Abstract Linear Inequality System

我们考虑抽象线性不平等系统(一， C， b ) 并且为系统给一个足够的条件(一， C， b ) 有一个错误跳了，它扩大以前的结果。

Some inequalities for the generalized linear distortion function

In this paper, we establish several inequalities for the the generalized linear distortion function λ（a, K） by using the monotonicity and convexity of certain combinations λ（a, K）.

AN ALGORITHM FOR SOLVING SYSTEM OF LINEAR INEQUALITIES

A new algorithm is presented for solving a system of linear inequalities. Starting at any point by solving a least squares problem we can either obtain a feasible point or determine that no solution exists.

ABS ALGORITHMS FOR SOLVING LINEAR INEQUALITIES

We consider a class of ABS type algorithms for solving system of linear inequalities, where the number of inequalities does not exceed the number of variables.

On absolute stability of Lur'e control systems with multiple non-linearities using linear matrix inequalities

Necessary and suffcient conditions for the existence of a Lyapunov function in the Lur ’ e form to guarantee the absolute stability of Lur’ e control systems with multiple non-linearities are discussed in this paper. It simplifies the existence problem to one of solving a set of linear matrix inequalities (LMIs). If those LMIs are feasible, free parameters in the Lyapunov function, such as the positive definite matrix and the coefficients of the integral terms, are given by the solution of the LMIs. Otherwise, this Lyapunov function does not exist. Some sufficient conditions are also obtained for the robust absolute stability of uncertain systems. A numerical example is provided to demonstrate the effectiveness of the proposed method.

Solution Building for Arbitrary System of Linear Inequalities in an Explicit Form

The known Fourier-Chernikov algorithm of linear inequality system convolution is complemented with an original procedure of all dependent (redundant) inequalities deletion. The concept of “almost dependent” inequalities is defined and an algorithm for further reducing the system by deletion of these is considered. The concluding algorithm makes it possible to hold actual-time convolution of a general inequality system containing up to 50 variables with the rigorous method of dependent inequalities deletion and up to 100 variables with the approximate method of one. The main application of such an approach consists in solving linear inequality system in an explicit form. These results are illustrated with a series of computer experiments.

Stechkin-Marchaud Type Inequalities in Lp for Linear Combination of Bernstein-Durrmeyer Operators

In this paper, we use the equivalence relation between K-functional and modulus of smoothness, and give the Stechkin-Marchaud-type inequalities for linear combination of Bernstein-Durrmeyer operators . Moreover, we obtain the inverse result of approximation for linear combination of Bernstein-Durrmeyer operators with . Meanwhile we unify and extend some previous results.

A New Weight Initialization Method Using Cauchy’s Inequality Based on Sensitivity Analysis

In this paper, an efficient weight initialization method is proposed using Cauchy’s inequality based on sensitivity analy- sis to improve the convergence speed in single hidden layer feedforward neural networks. The proposed method ensures that the outputs of hidden neurons are in the active region which increases the rate of convergence. Also the weights are learned by minimizing the sum of squared errors and obtained by solving linear system of equations. The proposed method is simulated on various problems. In all the problems the number of epochs and time required for the proposed method is found to be minimum compared with other weight initialization methods.

Income Inequality in Mountain Areas: The Case of Agroforestry Farming Systems in Uluguru Mountains, Tanzania

Land degradation due to use of unsustainable agricultural practices has affected many communities in rural mountain areas rendering them to be more vulnerable to income poverty and inequality. In this case, agroforestry systems promise to offer great solutions as they can be developed in unfavourable conditions where other production systems would either rapidly degrade the land or otherwise would not be possible. However, little is known whether agroforestry can address issues of income inequality in mountain areas. Hence, we conducted a study to investigate the nature and determinants of income inequality in Uluguru Mountains, Tanzania. Specifically, we used the cross-sectional research design and we calculated the income percentile shares, Gini coefficients and the coefficient of variation (CV), to pinpoint the nature of income inequality in the study area. The determinants of income inequality were analysed using the step by step multiple linear model. The results of analysis suggested prevalence of income inequality. Crop production was the main source of income in the agroforestry systems of the study area. Earnings from crops and timber were decreasing income-inequality amongst smallholder farmers. Our disaggregated analysis showed that off-farm income was also decreasing income-inequality for farmers with farmlands located close to homestead, for female-headed households, for farmers who did not access extension services, and those who were members of community-based financial institutions. Estimated incomes increased with household assets, size of farmland, and age of household head. However, the same decreased with household size. We found gender disparity to be one of the key issues that need attention in formulating future policies to reduce inequality. We recommend promotion of livelihood diversification as well as the designing and implementation of tailor-made training and farm financing mechanism to help the less resource-endowed farmers in mountain areas to raise their economic portfolios and social status and combat income poverty and inequality.

Event-Triggered Finite-Time H∞ Filtering for Discrete-Time Nonlinear Stochastic Systems

This paper addresses the problem of event-triggered finite-time H∞ filter design for a class of discrete-time nonlinear stochastic systems with exogenous disturbances. The stochastic Lyapunov-Krasoviskii functional method is adopted to design a filter such that the filtering error system is stochastic finite-time stable (SFTS) and preserves a prescribed performance level according to the pre-defined event-triggered criteria. Based on stochastic differential equations theory, some sufficient conditions for the existence of H∞ filter are obtained for the suggested system by employing linear matrix inequality technique. Finally, the desired H∞ filter gain matrices can be expressed in an explicit form.

非线性广义时滞Markov跳变系统的H_(∞)滑模控制

研究了一类转移速率部分未知的广义时滞Markov跳变系统的H_(∞)滑模控制问题.首先,对广义时滞Markov跳变系统设计了积分型滑模面,并求出对应的等效控制器.之后,构建Lyapunov泛函,通过线性矩阵不等式方法得到闭环系统随机容许且满足H_(∞)性能γ的充分条件,运用加减项方法以及引入自由权矩阵,使得到的结果降低了保守性;对滑模力学分析,设计了滑模控制器,使得系统能在有限时间内到达滑模面上.最后,通过数值算例与仿真验证了理论的可行性.