The UNIFORM C^(0)ESTIMATE AND WEIGHTED ESTIMATE OF GENERALIZED CHRISTOFFEL-MINKOWSKI PROBLEMS

In this paper,we consider generalized Christo®el-Minkowski problems as followsσ_(k)(u_(ij)+uδ_(ij))/σ_(l)(u_(ij)+uδ_(ij))=|u^(p-1)f(x),x∈S^(n),where 0≤l≤k≤n,p-1>0 and f is positive,and we establish the weighted gradient estimate and uniform C^(0)estimate for the positive convex even solutions,which is a generalization of Guan-Xia[1]and Guan[2].

线性化严格收缩的Peaceman-Reachford分裂方法

考虑具有线性约束的三块可分凸优化问题,在改进的严格收缩可分离的凸最小化模型分裂法(MSC-PRSM)的基础上,将原始问题的y-子问题和z-子问题的目标函数分别在y^(k)和z^(k)处进行线性化,并增加一个邻近项,使线性化的MSC-PRSM子问题更容易求解,降低了计算量,从计算时间角度比MSC-PRSM更有优势,并证明了新算法的收敛性.

Zeno’s Paradoxes and Lie Tzu’s Dichotomic Wisdom Explained with Alpha Beta (αβ) Asymptotic Nonlinear Math (Including One Example on Second Order Nonlinear Phenomena)

Zeno’s paradoxes are a set of philosophical problems that were first introduced by the ancient Greek philosopher Zeno of Elea. Here is the first attempt to use asymptotic approach and nonlinear concepts to address the paradoxes. Among the paradoxes, two of the most famous ones are Zeno’s Room Walk and Zeno’s Achilles. Lie Tsu’s pole halving dichotomy is also discussed in relation to these paradoxes. These paradoxes are first-order nonlinear phenomena, and we expressed them with the concepts of linear and nonlinear variables. In the new nonlinear concepts, variables are classified as either linear or nonlinear. Changes in linear variables are simple changes, while changes in nonlinear variables are nonlinear changes relative to their asymptotes. Continuous asymptotic curves are used to describe and derive the equations for expressing the relationship between two variables. For example, in Zeno’s Room Walk, the equations and curves for a person to walk from the initial wall towards the other wall are different from the equations and curves for a person to walk from the other wall towards the initial wall. One walk has a convex asymptotic curve with a nonlinear equation having two asymptotes, while the other walk has a concave asymptotic curve with a nonlinear equation having a finite starting number and a bottom asymptote. Interestingly, they have the same straight-line expression in a proportionality graph. The Appendix of this discussion includes an example of a second-order nonlinear phenomenon. .

Cooperative User-Scheduling and Resource Allocation Optimization for Intelligent Reflecting Surface Enhanced LEO Satellite Communication

Lower Earth Orbit(LEO) satellite becomes an important part of complementing terrestrial communication due to its lower orbital altitude and smaller propagation delay than Geostationary satellite. However, the LEO satellite communication system cannot meet the requirements of users when the satellite-terrestrial link is blocked by obstacles. To solve this problem, we introduce Intelligent reflect surface(IRS) for improving the achievable rate of terrestrial users in LEO satellite communication. We investigated joint IRS scheduling, user scheduling, power and bandwidth allocation(JIRPB) optimization algorithm for improving LEO satellite system throughput.The optimization problem of joint user scheduling and resource allocation is formulated as a non-convex optimization problem. To cope with this problem, the nonconvex optimization problem is divided into resource allocation optimization sub-problem and scheduling optimization sub-problem firstly. Second, we optimize the resource allocation sub-problem via alternating direction multiplier method(ADMM) and scheduling sub-problem via Lagrangian dual method repeatedly.Third, we prove that the proposed resource allocation algorithm based ADMM approaches sublinear convergence theoretically. Finally, we demonstrate that the proposed JIRPB optimization algorithm improves the LEO satellite communication system throughput.

A Relation between Resolvents of Subdifferentials and Metric Projections to Level Sets

An equation concerning with the subdifferential of convex functionals defined in real Banach spaces and the metric projections to level sets is shown. The equation is compared with the resolvents of general monotone operators, and makes the geometric properties of differential equations expressed by subdifferentials clear. Hence, it can be expected to be useful in obtaining the steepest descents defined by the convex functionals in Banach spaces. Also, it gives a similar result to the Lagrange multiplier method under certain conditions.

Partially-Observed Maximum Principle for Backward Stochastic Differential Delay Equations

Dear Editor,This letter investigates a partially-observed optimal control problem for backward stochastic differential delay equations(BSDDEs).By utilizing Girsanov’s theory and convex variational method,we obtain a maximum principle on the assumption that the state equation contains time delay and the control domain is convex.The adjoint processes can be represented as the solutions of certain time-advanced stochastic differential equations in finite-dimensional spaces.Linear backward stochastic differential equation(BSDE)was first introduced by Bismut in[1],while general BSDE was given by Pardoux and Peng[2].Since then,the theory of BSDEs developed rapidly.The corresponding optimal control problems,whose states are driven by BSDEs,have also been widely studied by some authors,see[3]-[5].

On the Application of Mixed Models of Probability and Convex Set for Time-Variant Reliability Analysis

In time-variant reliability problems,there are a lot of uncertain variables from different sources.Therefore,it is important to consider these uncertainties in engineering.In addition,time-variant reliability problems typically involve a complexmultilevel nested optimization problem,which can result in an enormous amount of computation.To this end,this paper studies the time-variant reliability evaluation of structures with stochastic and bounded uncertainties using a mixed probability and convex set model.In this method,the stochastic process of a limit-state function with mixed uncertain parameters is first discretized and then converted into a timeindependent reliability problem.Further,to solve the double nested optimization problem in hybrid reliability calculation,an efficient iterative scheme is designed in standard uncertainty space to determine the most probable point(MPP).The limit state function is linearized at these points,and an innovative random variable is defined to solve the equivalent static reliability analysis model.The effectiveness of the proposed method is verified by two benchmark numerical examples and a practical engineering problem.

Distributed Stochastic Optimization with Compression for Non-Strongly Convex Objectives

We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios.

PERIODIC SYSTEMS WITH TIME DEPENDENT MAXIMAL MONOTONE OPERATORS

We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the convex and nonconvex problems.We also show the existence of extremal periodic solutions and provide a strong relaxation theorem.Finally,we provide an application to nonlinear periodic control systems.

An Overview of Sequential Approximation in Topology Optimization of Continuum Structure

This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.

Application of ACP Nonlinear Math in Analyzing Arithmetic and Radiation Transmission Data (Application 1 & 2) [4-21-2024, 820P] (V)

In this study, we explore the application of ACP (asymptotic curve based and proportionality oriented) Alpha Beta (αβ) Nonlinear Math to analyze arithmetic and radiation transmission data. Specifically, we investigate the relationship between two variables. The novel approach involves collecting elementary “y” data and subsequently analyzing the asymptotic cumulative or demulative (opposite of cumulative) Y data. In part I, we examine the connection between the common linear numbers and ideal nonlinear numbers. In part II, we delve into the relationship between X-ray energy and the radiation transmission for various thin film materials. The fundamental physical law asserts that the nonlinear change in continuous variable Y is negatively proportional to the nonlinear change in continuous variable X, expressed mathematically as dα = −Kdβ. Here: dα {Y, Yu, Yb} represents the change in Y, with Yu and Yb denoting the upper and baseline asymptote of Y. dβ {X, Xu, Xb} represents the change in X, with Xu and Xb denoting the upper and baseline asymptote of X. K represents the proportionality constant or rate constant, which varies based on equation arrangement. K is the key inferential factor for describing physical phenomena.

Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems

The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization problems.In this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual vari-ables.By satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence rate.This only requires assuming convexity of the objective function.We validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments.

Retrospective and prospective review of the generalized nonlinear strength theory for geomaterials

Strength theory is the basic theory for calculating and designing the strength of engineering materials in civil,hydraulic,mechanical,aerospace,military,and other engineering disciplines.Therefore,the comprehensive study of the generalized nonlinear strength theory(GNST)of geomaterials has significance for the construction of engineering rock strength.This paper reviews the GNST of geomaterials to demonstrate the research status of nonlinear strength characteristics of geomaterials under complex stress paths.First,it systematically summarizes the research progress of GNST(classical and empirical criteria).Then,the latest research the authors conducted over the past five years on the GNST is introduced,and a generalized three-dimensional(3D)nonlinear Hoek‒Brown(HB)criterion(NGHB criterion)is proposed for practical applications.This criterion can be degenerated into the existing three modified HB criteria and has a better prediction performance.The strength prediction errors for six rocks and two in-situ rock masses are 2.0724%-3.5091%and 1.0144%-3.2321%,respectively.Finally,the development and outlook of the GNST are expounded,and a new topic about the building strength index of rock mass and determining the strength of in-situ engineering rock mass is proposed.The summarization of the GNST provides theoretical traceability and optimization for constructing in-situ engineering rock mass strength.

High-Order Decoupled and Bound Preserving Local Discontinuous Galerkin Methods for a Class of Chemotaxis Models

In this paper,we explore bound preserving and high-order accurate local discontinuous Galerkin(LDG)schemes to solve a class of chemotaxis models,including the classical Keller-Segel(KS)model and two other density-dependent problems.We use the convex splitting method,the variant energy quadratization method,and the scalar auxiliary variable method coupled with the LDG method to construct first-order temporal accurate schemes based on the gradient flow structure of the models.These semi-implicit schemes are decoupled,energy stable,and can be extended to high accuracy schemes using the semi-implicit spectral deferred correction method.Many bound preserving DG discretizations are only worked on explicit time integration methods and are difficult to get high-order accuracy.To overcome these difficulties,we use the Lagrange multipliers to enforce the implicit or semi-implicit LDG schemes to satisfy the bound constraints at each time step.This bound preserving limiter results in the Karush-Kuhn-Tucker condition,which can be solved by an efficient active set semi-smooth Newton method.Various numerical experiments illustrate the high-order accuracy and the effect of bound preserving.

Monolithic Convex Limiting for Legendre-Gauss-Lobatto Discontinuous Galerkin Spectral-Element Methods

We extend the monolithic convex limiting(MCL)methodology to nodal discontinuous Galerkin spectral-element methods(DGSEMS).The use of Legendre-Gauss-Lobatto(LGL)quadrature endows collocated DGSEM space discretizations of nonlinear hyperbolic problems with properties that greatly simplify the design of invariant domain-preserving high-resolution schemes.Compared to many other continuous and discontinuous Galerkin method variants,a particular advantage of the LGL spectral operator is the availability of a natural decomposition into a compatible subcellflux discretization.Representing a highorder spatial semi-discretization in terms of intermediate states,we performflux limiting in a manner that keeps these states and the results of Runge-Kutta stages in convex invariant domains.In addition,local bounds may be imposed on scalar quantities of interest.In contrast to limiting approaches based on predictor-corrector algorithms,our MCL procedure for LGL-DGSEM yields nonlinearflux approximations that are independent of the time-step size and can be further modified to enforce entropy stability.To demonstrate the robustness of MCL/DGSEM schemes for the compressible Euler equations,we run simulations for challenging setups featuring strong shocks,steep density gradients,and vortex dominatedflows.

基于不确定性估计的离线确定型Actor-Critic

Actor-Critic是一种强化学习方法,通过与环境在线试错交互收集样本来学习策略,是求解序贯感知决策问题的有效手段.但是,这种在线交互的主动学习范式在一些复杂真实环境中收集样本时会带来成本和安全问题离线强化学习作为一种基于数据驱动的强化学习范式,强调从静态样本数据集中学习策略,与环境无探索交互,为机器人、自动驾驶、健康护理等真实世界部署应用提供了可行的解决方案,是近年来的研究热点.目前,离线强化学习方法存在学习策略和行为策略之间的分布偏移挑战,针对这个挑战,通常采用策略约束或值函数正则化来限制访问数据集分布之外(Out-Of-Distribution,OOD)的动作,从而导致学习性能过于保守,阻碍了值函数网络的泛化和学习策略的性能提升.为此,本文利用不确定性估计和OOD采样来平衡值函数学习的泛化性和保守性,提出一种基于不确定性估计的离线确定型Actor-Critic方法(Offline Deterministic Actor-Critic based on UncertaintyEstimation,ODACUE).首先,针对确定型策略,给出一种Q值函数的不确定性估计算子定义,理论证明了该算子学到的Q值函数是最优Q值函数的一种悲观估计.然后,将不确定性估计算子应用于确定型Actor-Critic框架中,通过对不确定性估计算子进行凸组合构造Critic学习的目标函数.最后,D4RL基准数据集任务上的实验结果表明:相较于对比算法,ODACUE在11个不同质量等级数据集任务中的总体性能提升最低达9.56%,最高达64.92%.此外,参数分析和消融实验进一步验证了ODACUE的稳定性和泛化能力.

NONEMPTY INTERSECTION THEOREMS AND SYSTEM OF GENERALIZED VECTOR EQUILIBRIUM PROBLEMS IN PRODUCT G-CONVEX SPACES

By using an existence theorems of maximal elements for a family of set-valued mappings in G-convex spaces due to the author, some new nonempty intersection theorems for a family of set-valued mappings were established in noncompact product G-convex spaces. As applications, some equilibrium existence theorems for a system of generalized vector equilibrium problems were proved in noncompact product G-convex spaces. These theorems unify, improve and generalize some important known results in literature.

Influence of Dimensions of UHMW-PE Protuberances on Sliding Resistance and Normal Adhesion of Bangkok Clay Soil to Biomimetic Plates

A number of investigations into application of polymers for macro-morphological modification of tool surface have been carried out. These researches, with extensive stress on convex or domed protuberations as one of the widely used construction units, have tried to harness benefits from using polymers in agriculture. Ultra high molecular weight polyethylene （UHMW-PE） has proved an emerging polymer in its application to reduce soil adhesion. This research was conducted to study the effect of shape （flat, semi-spherical, semi-oblate, semi short-prolate and semi long-prolate） and dimensions （base diameter and dome height） on sliding resistance and normal adhesion of biomimetic plates. To incorporate both shape and size, a dimensionless ratio of height to diameter （HDR） was introduced to characterize the effect of construction unit＇s physique. Experiments were conducted in Bangkok clay soil with dry （ 19.8% d.b.）, sticky （36.9% d.b.） and flooded （60.1% d.b.） soil conditions respectively. Soil at sticky limit exhibited the highest sliding resistance （77.8 N） and normal adhesion （3 kPa to 7 kPa）, whereas these values were 61.7 N and 〈0.2 kPa in dry, and 53.7 N and 0.5 kPa to 1.5 kPa in flooded soil conditions. Protuberances with HDR ≤ 0.5 lowered sliding resistance by 10% - 30% and the same reduced normal adhesion by 10% - 60%. The amount of reduction in both sliding resistance and normal adhesion was higher in flooded soil. Lighter normal loads obviously produced lesser resistance and adhesion.

MONOTONICITY,CONVEXITY AND INEQUALITIES INVOLVING THE GENERALIZED ELLIPTIC INTEGRALS

We establish the monotonicity and convexity properties for several special functions involving the generalized elliptic integrals, and present some new analytic inequalities.

Joint optimization of LORA and spares stocks considering corrective maintenance time

Level of repair analysis（LORA） is an important method of maintenance decision for establishing systems of operation and maintenance in the equipment development period. Currently, the research on equipment of repair level focuses on economic analysis models which are used to optimize costs and rarely considers the maintenance time required by the implementation of the maintenance program. In fact, as to the system requiring high mission complete success, the maintenance time is an important factor which has a great influence on the availability of equipment systems. Considering the relationship between the maintenance time and the spares stocks level, it is obvious that there are contradictions between the maintenance time and the cost. In order to balance these two factors, it is necessary to build an optimization LORA model. To this end, the maintenance time representing performance characteristic is introduced, and on the basis of spares stocks which is traditionally regarded as a decision variable, a decision variable of repair level is added, and a multi-echelon multiindenture（MEMI） optimization LORA model is built which takes the best cost-effectiveness ratio as the criterion, the expected number of backorder（EBO） as the objective function and the cost as the constraint. Besides, the paper designs a convex programming algorithm of multi-variable for the optimization model, provides solutions to the non-convex objective function and methods for improving the efficiency of the algorithm. The method provided in this paper is proved to be credible and effective according to the numerical example and the simulation result.