熵函数法的数学理论

１．引言考虑复合函数其中ｇ;：Ｒ"－Ｒ,ｉ＝１,２,...;。连续可微．因的ｘ）的不可微性,涉及的ｘ）的优化问题,如极大极小问题Ｉｒｌｍｌｎｏｔｘｊ．ｆｉｊＺＦＲ"通常属不可微优化范畴．文山借助最大嫡原理推导出一类一致逼近一（Ｘ）的可微函数（称之为妨函数）Ｏ。ｉｌｌ--一ｉｆｌｙｌｌＸＤＣＱ．ｌｏｌｌ．ＩＪｊ容易证明ｔｉｍ人一中且对任意ｘＥＲ",ＣＭ＋ＯＯｇｂｃｌ（ｌ＞ｏｆｃ。（ｌ,ＶＣＺ＞ＣＩ＞０,（４ｉｌｌｆｆｉ０＜ｕｌ。（）ｄｉ（］＜．（５基于该性质,文山一【４］通过一次取定较大有限值Ｃ。＞０,将…     

Dynamic programming and Lagrange multipliers for active relaxation of resources in nonlinear non-equilibrium systems

In power production problems maximum power and minimum entropy production and inherently connected by the Gouy–Stodola law. In this paper various mathematical tools are applied in dynamic optimization of power-maximizing paths, with special attention paid to nonlinear systems. Maximum power and/or minimum entropy production are governed by Hamilton–Jacobi–Bellman (HJB) equations which describe the value function of the problem and associated controls. Yet, in many cases optimal relaxation curve is non-exponential, governing HJB equations do not admit classical solutions and one has to work with viscosity solutions. Systems with nonlinear kinetics (e.g. radiation engines) are particularly difficult, thus, discrete counterparts of continuous HJB equations and numerical approaches are recommended. Discrete algorithms of dynamic programming (DP), which lead to power limits and associated availabilities, are effective. We consider convergence of discrete algorithms to viscosity solutions of HJB equations, discrete approximations, and the role of Lagrange multiplier λ associated with the duration constraint. In analytical discrete schemes, the Legendre transformation is a significant tool leading to original work function. We also describe numerical algorithms of dynamic programming and consider dimensionality reduction in these algorithms. Indications showing the method potential for other systems, in particular chemical energy systems, are given.     

On the fuzzy minimum entropy control to stabilize the unstable fixed points of chaotic maps

This paper presents a fuzzy algorithm for controlling chaos in nonlinear systems via minimum entropy approach. The proposed fuzzy logic algorithm is used to minimize the Shannon entropy of a chaotic dynamics. The fuzzy laws are determined in such a way that the entropy function descends until the chaotic trajectory of the system is replaced by a regular one. The Logistic and the Henon maps as two discrete chaotic systems, and the Duffing equation as a continuous one are used to validate the proposed scheme and show the effectiveness of the control method in chaotic dynamical systems.     

从常步长梯度方法的视角看不可微凸优化增广Lagrange方法的收敛性

增广Lagrange方法是求解非线性规划的一种有效方法.从一新的角度证明不等式约束非线性非光滑凸优化问题的增广Lagrange方法的收敛性.用常步长梯度法的收敛性定理证明基于增广Lagrange函数的对偶问题的常步长梯度方法的收敛性,由此得到增广Lagrange方法乘子迭代的全局收敛性.     

用非线性方程组求解等式约束非线性规划问题的降维算法

本文研究线性和非线性等式约束非线性规划问题的降维算法.首先,利用一般等式约束问题的降维方法,将线性等式约束非线性规划问题转换成一个非线性方程组,解非线性方程组即得其解;然后,对线性和非线性等式约束非线性规划问题用Lagrange乘子法,将非线性约束部分和目标函数构成增广的Lagrange函数,并保留线性等式约束,这样便得到一个线性等式约束非线性规划序列,从而,又将问题转化为求解只含线性等式约束的非线性规划问题.     

On the numerical determination of optimal inputs

The design of optimal inputs for linear and nonlinear system identification involves the maximization of a quadratic performance index subject to an input energy constraint. In the classical approach, a Lagrange multiplier is introduced whose value is an unknown constant. In recent papers, the Lagrange multiplier has been determined by plotting a curve of the Lagrange multiplier as a function of the critical interval length or a curve of input energy versus the interval length. A new approach is presented in this paper in which the Lagrange multiplier is introduced as a state variable and evaluated simultaneously with the optimal input. Numerical results are given for both a linear and a nonlinear dynamic system.     

Entropy stable shock capturing space–time discontinuous Galerkin schemes for systems of conservation laws

We present a streamline diffusion shock capturing spacetime discontinuous Galerkin (DG) method to approximate nonlinear systems of conservation laws in several space dimensions. The degrees of freedom are in terms of the entropy variables and the numerical flux functions are the entropy stable finite volume fluxes. We show entropy stability of the (formally) arbitrarily high order accurate method for a general system of conservation laws. Furthermore, we prove that the approximate solutions converge to the entropy measure valued solutions for nonlinear systems of conservation laws. Convergence to entropy solutions for scalar conservation laws and for linear symmetrizable systems is also shown. Numerical experiments are presented to illustrate the robustness of the proposed schemes.     

Lagrangian systems of conservation laws

Summary. We study the mathematical structure of 1D systems of conservation laws written in the Lagrange variable. Modifying the symmetrization proof of systems of conservation laws with three hypothesis, we prove that these models have a canonical formalism. These hypothesis are i) the entropy flux is zero, ii) Galilean invariance, iii) reversibility for smooth solutions. Then we study a family of numerical schemes for the solution of these systems. We prove that they are entropy consistent. We also prove from general considerations the symmetry of the spectrum of the Jacobian matrix. Received December 15, 1999 / Published online February 5, 2001     

A modified objective function method for solving nonlinear multiobjective fractional programming problems

A new method is used for solving nonlinear multiobjective fractional programming problems having V-invex objective and constraint functions with respect to the same function η. In this approach, an equivalent vector programming problem is constructed by a modification of the objective fractional function in the original nonlinear multiobjective fractional problem. Furthermore, a modified Lagrange function is introduced for a constructed vector optimization problem. By the help of the modified Lagrange function, saddle point results are presented for the original nonlinear fractional programming problem with several ratios. Finally, a Mond-Weir type dual is associated, and weak, strong and converse duality results are established by using the introduced method with a modified function. To obtain these duality results between the original multiobjective fractional programming problem and its original Mond-Weir duals, a modified Mond-Weir vector dual problem with a modified objective function is constructed.     

Weakly Nonlinear Geometric Optics for Hyperbolic Systems of Conservation Laws

We present a new approach to analyze the validation of weakly nonlinear geometric optics for entropy solutions of nonlinear hyperbolic systems of conservation laws whose eigenvalues are allowed to have constant multiplicity and corresponding characteristic fields to be linearly degenerate. The approach is based on our careful construction of more accurate auxiliary approximation to weakly nonlinear geometric optics, the properties of wave front-tracking approximate solutions, the behavior of solutions to the approximate asymptotic equations, and the standard semigroup estimates. To illustrate this approach more clearly, we focus first on the Cauchy problem for the hyperbolic systems with compact support initial data of small bounded variation and establish that the L ¹-estimate between the entropy solution and the geometric optics expansion function is bounded by O(?²), independent of the time variable. This implies that the simpler geometric optics expansion functions can be employed to study the behavior of general entropy solutions to hyperbolic systems of conservation laws. Finally, we extend the results to the case with non-compact support initial data of bounded variation.     

k-均值问题的差分隐私算法综述

$k$-均值问题是机器学习和组合优化领域十分重要的问题。它是经典的NP-难问题, 被广泛的应用于数据挖掘、企业生产决策、图像处理、生物医疗科技等领域。随着时代的发展, 人们越来越注重于个人的隐私保护:在决策通常由人工智能算法做出的情况下, 如何保证尽可能多地从数据中挖掘更多信息,同时不泄露个人隐私。近十年来不断有专家学者研究探索带隐私保护的$k$-均值问题, 得到了许多具有理论指导意义和实际应用价值的结果, 本文主要介绍关于$k$-均值问题的差分隐私算法供读者参考。     

Extended Lagrange and Penalty Functions in Optimization

We consider nonlinear Lagrange and penalty functions for optimization problems with a single constraint. The convolution of the objective function and the constraint is accomplished by an increasing positively homogeneous of the first degree function. We study necessary and also sufficient conditions for the validity of the zero duality gap property for both Lagrange and penalty functions and for the exact penalization. We also study the so-called regular weak separation functions.     

Second-order nonlinear impulsive evolution equations with time-varying generating operators and optimal controls

In this article, the second-order nonlinear impulsive evolution differential equations with time-varying generating operators is considered. Constructing evolution systems generated by time-varying operator matrix, we introduce suitable mild solution of the second-order nonlinear impulsive evolution differential equations. The existence and uniqueness of the mild solutions and the continuous dependence on initial value are proved. The existence of the optimal controls for a Lagrange problem of the systems governed by the second-order nonlinear impulsive evolution equations is also presented. An example is given for demonstration.     

Control of nonlinear systems that are subjected to kinematic inequalities

This letter deals with the Lagrange equations concerning nonlinear systems which are subjected to a class of kinematic inequalities.     

Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints

An augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints is proposed based on a Löwner operator associated with a potential function for the optimization problems with inequality constraints. The favorable properties of both the Löwner operator and the corresponding augmented Lagrangian are discussed. And under some mild assumptions, the rate of convergence of the augmented Lagrange algorithm is studied in detail.     

凸规划的极大熵函数序列及其收敛性

为了消除凸规划问题中极大熵方法所导致的数值病态，该文应用Lagrange乘子法及赋范原理，给出一类凸规划问题的极大熵函数序列，并证明该序列一致收敛于凸规划的最优解。     

Convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems

The convergence analysis of a nonlinear Lagrange algorithm for solving nonlinear constrained optimization problems with both inequality and equality constraints is explored in detail. The estimates for the derivatives of the multiplier mapping and the solution mapping of the proposed algorithm are discussed via the technique of the singular value decomposition of matrix. Based on the estimates, the local convergence results and the rate of convergence of the algorithm are presented when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions. Furthermore, the condition number of the Hessian of the nonlinear Lagrange function with respect to the decision variables is analyzed, which is closely related to efficiency of the algorithm. Finally, the preliminary numericM results for several typical test problems are reported.     

Banach空间中一类周期非线性受控系统最优控制的存在性

研究一类强非线性发展方程的周期解及相应的最优控制问题的存在性，首先，证明了Banach空间中一类包含非线性单调算子和非线性非单调扰动的强非线性发展方程周期解的存在性；其次，给出了保证相应的Lagrange最优控制的充分条件；最后，举例说明理论结果在拟线笥抛物方程周期问题及相应的最优控制问题中的应用。     

On the existence of optimal controls for nonlinear infinite dimensional systems

We consider nonlinear systems with a priori feedback. We establish the existence of admissible pairs and then we show that the Lagrange optimal control problem admits an optimal pair. As application we work out in detail two examples of optimal control problems for nonlinear parabolic partial differential equations.     

Canonical duality for solving general nonconvex constrained problems

This paper presents a canonical duality theory for solving a general nonconvex constrained optimization problem within a unified framework to cover Lagrange multiplier method and KKT theory. It is proved that if both target function and constraints possess certain patterns necessary for modeling real systems, a perfect dual problem (without duality gap) can be obtained in a unified form with global optimality conditions provided.While the popular augmented Lagrangian method may produce more difficult nonconvex problems due to the nonlinearity of constraints. Some fundamental concepts such as the objectivity and Lagrangian in nonlinear programming are addressed.