A generalized nonlinear three-dimensional Hoek‒Brown failure criterion

To understand the strengths of rocks under complex stress states,a generalized nonlinear threedimensional(3D)Hoek‒Brown failure(NGHB)criterion was proposed in this study.This criterion shares the same parameters with the generalized HB(GHB)criterion and inherits the parameter advantages of GHB.Two new parameters,b,and n,were introduced into the NGHB criterion that primarily controls the deviatoric plane shape of the NGHB criterion under triaxial tension and compression,respectively.The NGHB criterion can consider the influence of intermediate principal stress(IPS),where the deviatoric plane shape satisfies the smoothness requirements,while the HB criterion not.This criterion can degenerate into the two modified 3D HB criteria,the Priest criterion under triaxial compression condition and the HB criterion under triaxial compression and tension condition.This criterion was verified using true triaxial test data for different parameters,six types of rocks,and two kinds of in situ rock masses.For comparison,three existing 3D HB criteria were selected for performance comparison research.The result showed that the NGHB criterion gave better prediction performance than other criteria.The prediction errors of the strength of six types of rocks and two kinds of in situ rock masses were in the range of 2.0724%-3.5091%and 1.0144%-3.2321%,respectively.The proposed criterion lays a preliminary theoretical foundation for prediction of engineering rock mass strength under complex in situ stress conditions.

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.

Solving Hardware/Software Partitioning via a Discrete Dynamic Convexized Method

Hardware/software partitioning is an important step in the design of embedded systems. In this paper, the hardware/software partitioning problem is modeled as a constrained binary integer programming problem, which is further converted equivalently to an unconstrained binary integer programming problem by a penalty method. A local search method, HSFM, is developed to obtain a discrete local minimizer of the unconstrained binary integer programming problem. Next, an auxiliary function, which has the same global optimal solutions as the unconstrained binary integer programming problem, is constructed, and its properties are studied. We show that applying HSFM to minimize the auxiliary function can escape from previous local optima by the increase of the parameter value successfully. Finally, a discrete dynamic convexized method is developed to solve the hardware/software partitioning problem. Computational results and comparisons indicate that the proposed algorithm can get high-quality solutions.

CONVEXITY OF THE FREE BOUNDARY FOR AN AXISYMMETRIC INCOMPRESSIBLE IMPINGING JET

This paper is devoted to the study of the shape of the free boundary for a threedimensional axisymmetric incompressible impinging jet.To be more precise,we will show that the free boundary is convex to the fluid,provided that the uneven ground is concave to the fluid.

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].

Optimal Positioning Strategy for Multi-Camera Zooming Drones

In the context of multiple-target tracking and surveillance applications,this paper investigates the challenge of determining the optimal positioning of a single autonomous aerial vehicle or agent equipped with multiple independently-steerable zooming cameras to effectively monitor a set of targets of interest.Each camera is dedicated to tracking a specific target or cluster of targets.The key innovation of this study,in comparison to existing approaches,lies in incorporating the zooming factor for the onboard cameras into the optimization problem.This enhancement offers greater flexibility during mission execution by allowing the autonomous agent to adjust the focal lengths of the onboard cameras,in exchange for varying real-world distances to the corresponding targets,thereby providing additional degrees of freedom to the optimization problem.The proposed optimization framework aims to strike a balance among various factors,including distance to the targets,verticality of viewpoints,and the required focal length for each camera.The primary focus of this paper is to establish the theoretical groundwork for addressing the non-convex nature of the optimization problem arising from these considerations.To this end,we develop an original convex approximation strategy.The paper also includes simulations of diverse scenarios,featuring varying numbers of onboard tracking cameras and target motion profiles,to validate the effectiveness of the proposed approach.

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.

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.

Relaxed Stability Criteria for Time-Delay Systems:A Novel Quadratic Function Convex Approximation Approach

This paper develops a quadratic function convex approximation approach to deal with the negative definite problem of the quadratic function induced by stability analysis of linear systems with time-varying delays.By introducing two adjustable parameters and two free variables,a novel convex function greater than or equal to the quadratic function is constructed,regardless of the sign of the coefficient in the quadratic term.The developed lemma can also be degenerated into the existing quadratic function negative-determination(QFND)lemma and relaxed QFND lemma respectively,by setting two adjustable parameters and two free variables as some particular values.Moreover,for a linear system with time-varying delays,a relaxed stability criterion is established via our developed lemma,together with the quivalent reciprocal combination technique and the Bessel-Legendre inequality.As a result,the conservatism can be reduced via the proposed approach in the context of constructing Lyapunov-Krasovskii functionals for the stability analysis of linear time-varying delay systems.Finally,the superiority of our results is illustrated through three numerical examples.

Optimization in Machine Learning:a Distribution-Space Approach

We present the viewpoint that optimization problems encountered in machine learning can often be interpreted as minimizing a convex functional over a function space,but with a non-convex constraint set introduced by model parameterization.This observation allows us to repose such problems via a suitable relaxation as convex optimization problems in the space of distributions over the training parameters.We derive some simple relationships between the distribution-space problem and the original problem,e.g.,a distribution-space solution is at least as good as a solution in the original space.Moreover,we develop a numerical algorithm based on mixture distributions to perform approximate optimization directly in the distribution space.Consistency of this approximation is established and the numerical efficacy of the proposed algorithm is illustrated in simple examples.In both theory and practice,this formulation provides an alternative approach to large-scale optimization in machine learning.

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.

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.

Channel Estimation for Reconfigurable Intelligent Surface Aided Multiuser Millimeter-Wave/THz Systems

It is assumed that reconfigurable intelligent surface(RIS)is a key technology to enable the potential of mmWave communications.The passivity of the RIS makes channel estimation difficult because the channel can only be measured at the transceiver and not at the RIS.In this paper,we propose a novel separate channel estimator via exploiting the cascaded sparsity in the continuously valued angular domain of the cascaded channel for the RIS-enabled millimeter-wave/Tera-Hz systems,i.e.,the two-stage estimation method where the cascaded channel is separated into the base station(BS)-RIS and the RIS-user(UE)ones.Specifically,we first reveal the cascaded sparsity,i.e.,the sparsity exists in the hybrid angular domains of BS-RIS and the RIS-UEs separated channels,to construct the specific sparsity structure for RIS enabled multi-user systems.Then,we formulate the channel estimation problem using atomic norm minimization(ANM)to enhance the proposed sparsity structure in the continuous angular domains,where a low-complexity channel estimator via Alternating Direction Method of Multipliers(ADMM)is proposed.Simulation findings demonstrate that the proposed channel estimator outperforms the current state-of-the-arts in terms of performance.

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.

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.

A SINGULAR DIRICHLET PROBLEM FOR THE MONGE-AMPÈRE TYPE EQUATION

We consider the singular Dirichlet problem for the Monge-Ampère type equation{\rm det}\D^2 u=b(x)g(-u)(1+|\nabla u|^2)^{q/2},\u<0,\x\in\Omega,\u|_{\partial\Omega}=0,whereΩis a strictly convex and bounded smooth domain inℝn,q∈[0,n+1),g∈C∞(0,∞)is positive and strictly decreasing in(0,∞)with\lim\limits_{s\rightarrow 0^+}g(s)=\infty,and b∈C∞(Ω)is positive inΩ.We obtain the existence,nonexistence and global asymptotic behavior of the convex solution to such a problem for more general b and g.Our approach is based on the Karamata regular variation theory and the construction of suitable sub-and super-solutions.

Arc Grounding Fault Identification Using Integrated Characteristics in the Power Grid

Arc grounding faults occur frequently in the power grid with small resistance grounding neutral points.The existing arc fault identification technology only uses the fault line signal characteristics to set the identification index,which leads to detection failure when the arc zero-off characteristic is short.To solve this problem,this paper presents an arc fault identification method by utilizing integrated signal characteristics of both the fault line and sound lines.Firstly,the waveform characteristics of the fault line and sound lines under an arc grounding fault are studied.After that,the convex hull,gradient product,and correlation coefficient index are used as the basic characteristic parameters to establish fault identification criteria.Then,the logistic regression algorithm is employed to deal with the reference samples,establish the machine discrimination model,and realize the discrimination of fault types.Finally,simulation test results and experimental results verify the accuracy of the proposed method.The comparison analysis shows that the proposed method has higher recognition accuracy,especially when the arc dissipation power is smaller than 2×10^(3) W,the zero-off period is not obvious.In conclusion,the proposed method expands the arc fault identification theory.

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.

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].

Combining Clustered Adaptive Multistart and Discrete Dynamic Convexized Method for the Max-Cut Problem

Given an undirected graph with edge weights,the max-cut problem is to find a partition of the vertices into twosubsets,such that the sumof theweights of the edges crossing different subsets ismaximized.Heuristics based on auxiliary function can obtain high-quality solutions of the max-cut problem,but suffer high solution cost when instances grow large.In this paper,we combine clustered adaptive multistart and discrete dynamic convexized method to obtain high-quality solutions in a reasonable time.Computational experiments on two sets of benchmark instances from the literature were performed.Numerical results and comparisons with some heuristics based on auxiliary function show that the proposed algorithm is much faster and can obtain better solutions.Comparisons with several state-ofthe-science heuristics demonstrate that the proposed algorithm is competitive.