Composition Analysis and Identification of Ancient Glass Products Based on L1 Regularization Logistic Regression

In view of the composition analysis and identification of ancient glass products, L1 regularization, K-Means cluster analysis, elbow rule and other methods were comprehensively used to build logical regression, cluster analysis, hyper-parameter test and other models, and SPSS, Python and other tools were used to obtain the classification rules of glass products under different fluxes, sub classification under different chemical compositions, hyper-parameter K value test and rationality analysis. Research can provide theoretical support for the protection and restoration of ancient glass relics.

Convergent Data-Driven Regularizations for CT Reconstruction

The reconstruction of images from their corresponding noisy Radon transform is a typical example of an ill-posed linear inverse problem as arising in the application of computerized tomography(CT).As the(naive)solution does not depend on the measured data continuously,regularization is needed to reestablish a continuous dependence.In this work,we investigate simple,but yet still provably convergent approaches to learning linear regularization methods from data.More specifically,we analyze two approaches:one generic linear regularization that learns how to manipulate the singular values of the linear operator in an extension of our previous work,and one tailored approach in the Fourier domain that is specific to CT-reconstruction.We prove that such approaches become convergent regularization methods as well as the fact that the reconstructions they provide are typically much smoother than the training data they were trained on.Finally,we compare the spectral as well as the Fourier-based approaches for CT-reconstruction numerically,discuss their advantages and disadvantages and investigate the effect of discretization errors at differentresolutions.

Impact Force Localization and Reconstruction via ADMM-based Sparse Regularization Method

In practice,simultaneous impact localization and time history reconstruction can hardly be achieved,due to the illposed and under-determined problems induced by the constrained and harsh measuring conditions.Although l_(1) regularization can be used to obtain sparse solutions,it tends to underestimate solution amplitudes as a biased estimator.To address this issue,a novel impact force identification method with l_(p) regularization is proposed in this paper,using the alternating direction method of multipliers(ADMM).By decomposing the complex primal problem into sub-problems solvable in parallel via proximal operators,ADMM can address the challenge effectively.To mitigate the sensitivity to regularization parameters,an adaptive regularization parameter is derived based on the K-sparsity strategy.Then,an ADMM-based sparse regularization method is developed,which is capable of handling l_(p) regularization with arbitrary p values using adaptively-updated parameters.The effectiveness and performance of the proposed method are validated on an aircraft skin-like composite structure.Additionally,an investigation into the optimal p value for achieving high-accuracy solutions via l_(p) regularization is conducted.It turns out that l_(0.6)regularization consistently yields sparser and more accurate solutions for impact force identification compared to the classic l_(1) regularization method.The impact force identification method proposed in this paper can simultaneously reconstruct impact time history with high accuracy and accurately localize the impact using an under-determined sensor configuration.

Enhanced Differentiable Architecture Search Based on Asymptotic Regularization

In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach.

Trigonometric Regularization and Continuation Method Based Time-Optimal Control of Hypersonic Vehicles

Aiming at the time-optimal control problem of hypersonic vehicles(HSV)in ascending stage,a trigonometric regularization method(TRM)is introduced based on the indirect method of optimal control.This method avoids analyzing the switching function and distinguishing between singular control and bang-bang control,where the singular control problem is more complicated.While in bang-bang control,the costate variables are unsmooth due to the control jumping,resulting in difficulty in solving the two-point boundary value problem(TPBVP)induced by the indirect method.Aiming at the easy divergence when solving the TPBVP,the continuation method is introduced.This method uses the solution of the simplified problem as the initial value of the iteration.Then through solving a series of TPBVP,it approximates to the solution of the original complex problem.The calculation results show that through the above two methods,the time-optimal control problem of HSV in ascending stage under the complex model can be solved conveniently.

Low-Rank Multi-View Subspace Clustering Based on Sparse Regularization

Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.

Enhanced Deep Reinforcement Learning Strategy for Energy Management in Plug-in Hybrid Electric Vehicles with Entropy Regularization and Prioritized Experience Replay

Plug-in Hybrid Electric Vehicles(PHEVs)represent an innovative breed of transportation,harnessing diverse power sources for enhanced performance.Energy management strategies(EMSs)that coordinate and control different energy sources is a critical component of PHEV control technology,directly impacting overall vehicle performance.This study proposes an improved deep reinforcement learning(DRL)-based EMSthat optimizes realtime energy allocation and coordinates the operation of multiple power sources.Conventional DRL algorithms struggle to effectively explore all possible state-action combinations within high-dimensional state and action spaces.They often fail to strike an optimal balance between exploration and exploitation,and their assumption of a static environment limits their ability to adapt to changing conditions.Moreover,these algorithms suffer from low sample efficiency.Collectively,these factors contribute to convergence difficulties,low learning efficiency,and instability.To address these challenges,the Deep Deterministic Policy Gradient(DDPG)algorithm is enhanced using entropy regularization and a summation tree-based Prioritized Experience Replay(PER)method,aiming to improve exploration performance and learning efficiency from experience samples.Additionally,the correspondingMarkovDecision Process(MDP)is established.Finally,an EMSbased on the improvedDRLmodel is presented.Comparative simulation experiments are conducted against rule-based,optimization-based,andDRL-based EMSs.The proposed strategy exhibitsminimal deviation fromthe optimal solution obtained by the dynamic programming(DP)strategy that requires global information.In the typical driving scenarios based onWorld Light Vehicle Test Cycle(WLTC)and New European Driving Cycle(NEDC),the proposed method achieved a fuel consumption of 2698.65 g and an Equivalent Fuel Consumption(EFC)of 2696.77 g.Compared to the DP strategy baseline,the proposed method improved the fuel efficiency variances(FEV)by 18.13%,15.1%,and 8.37%over the Deep QNetwork(DQN),Double DRL(DDRL),and original DDPG methods,respectively.The observational outcomes demonstrate that the proposed EMS based on improved DRL framework possesses good real-time performance,stability,and reliability,effectively optimizing vehicle economy and fuel consumption.

3D density inversion of gravity gradient data using the extrapolated Tikhonov regularization

We use the extrapolated Tikhonov regularization to deal with the ill-posed problem of 3D density inversion of gravity gradient data. The use of regularization parameters in the proposed method reduces the deviations between calculated and observed data. We also use the depth weighting function based on the eigenvector of gravity gradient tensor to eliminate undesired effects owing to the fast attenuation of the position function. Model data suggest that the extrapolated Tikhonov regularization in conjunction with the depth weighting function can effectively recover the 3D distribution of density anomalies. We conduct density inversion of gravity gradient data from the Australia Kauring test site and compare the inversion results with the published research results. The proposed inversion method can be used to obtain the 3D density distribution of underground anomalies.

Iterative regularization method for image denoising with adaptive scale parameter

In order to decrease the sensitivity of the constant scale parameter, adaptively optimize the scale parameter in the iteration regularization model （IRM） and attain a desirable level of applicability for image denoising, a novel IRM with the adaptive scale parameter is proposed. First, the classic regularization item is modified and the equation of the adaptive scale parameter is deduced. Then, the initial value of the varying scale parameter is obtained by the trend of the number of iterations and the scale parameter sequence vectors. Finally, the novel iterative regularization method is used for image denoising. Numerical experiments show that compared with the IRM with the constant scale parameter, the proposed method with the varying scale parameter can not only reduce the number of iterations when the scale parameter becomes smaller, but also efficiently remove noise when the scale parameter becomes bigger and well preserve the details of images.

Application of Tikhonov regularization method to wind retrieval from scatterometer data Ⅱ: cyclone wind retrieval with consideration of rain

According to the conclusion of the simulation experiments in paper I, the Tikhonov regularization method is applied to cyclone wind retrieval with a rain-effect-considering geophysical model function （called CMF＋Rain）. The CMF＋Rain model which is based on the NASA scatterometer-2 （NSCAT2） GMF is presented to compensate for the effects of rain on cyclone wind retrieval. With the multiple solution scheme （MSS）, the noise of wind retrieval is effectively suppressed, but the influence of the background increases. It will cause a large wind direction error in ambiguity removal when the background error is large. However, this can be mitigated by the new ambiguity removal method of Tikhonov regularization as proved in the simulation experiments. A case study on an extratropical cyclone of hurricane observed with SeaWinds at 25-km resolution shows that the retrieved wind speed for areas with rain is in better agreement with that derived from the best track analysis for the GMF＋Rain model, but the wind direction obtained with the two-dimensional variational （2DVAR） ambiguity removal is incorrect. The new method of Tikhonov regularization effectively improves the performance of wind direction ambiguity removal through choosing appropriate regularization parameters and the retrieved wind speed is almost the same as that obtained from the 2DVAR.

New normalized LMS adaptive filter with a variable regularization factor

A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization factor(RF) is then employed to control the contribution made by the MD constraint in the cost function. Analysis results show that the RF can be taken as a combination of the step size and regularization parameter in the conventional NLMS. This implies that these parameters can be jointly controlled by simply tuning the RF as the proposed algorithm does. It also demonstrates that the RF can accelerate the convergence rate of the proposed algorithm and its optimal value can be obtained by minimizing the squared noise-free posteriori error. A method for automatically determining the value of the RF is also presented, which is free of any prior knowledge of the noise. While simulation results verify the analytical ones, it is also illustrated that the performance of the proposed algorithm is superior to the state-of-art ones in both the steady-state misalignment and the convergence rate. A novel algorithm is proposed to solve some problems. Simulation results show the effectiveness of the proposed algorithm.

Variational regularization method of solving the Cauchy problem for Laplace's equation: Innovation of the Grad–Shafranov(GS) reconstruction

The simplified linear model of Grad-Shafranov （GS） reconstruction can be reformulated into an inverse boundary value problem of Laplace＇s equation. Therefore, in this paper we focus on the method of solving the inverse boundary value problem of Laplace＇s equation. In the first place, the variational regularization method is used to deal with the ill- posedness of the Cauchy problem for Laplace＇s equation. Then, the ＇L-Curve＇ principle is suggested to be adopted in choosing the optimal regularization parameter. Finally, a numerical experiment is implemented with a section of Neumann and Dirichlet boundary conditions with observation errors. The results well converge to the exact solution of the problem, which proves the efficiency and robustness of the proposed method. When the order of observation error δ is 10-1, the order of the approximate result error can reach 10-3.

Regularization Method to the Parameter Identification of Interfacial Heat Transfer Coefficient and Properties during Casting Solidification

The accurate material physical properties, initial and boundary conditions are indispensable to the numerical simulation in the casting process, and they are related to the simulation accuracy directly. The inverse heat conduction method can be used to identify the mentioned above parameters based on the temperature measurement data. This paper presented a new inverse method according to Tikhonov regularization theory. A regularization functional was established and the regularization parameter was deduced, the Newton-Raphson iteration method was used to solve the equations. One detailed case was solved to identify the thermal conductivity and specific heat of sand mold and interfacial heat transfer coefficient (IHTC) at the meantime. This indicates that the regularization method is very efficient in decreasing the sensitivity to the temperature measurement data, overcoming the ill-posedness of the inverse heat conduction problem (IHCP) and improving the stability and accuracy of the results. As a general inverse method, it can be used to identify not only the material physical properties but also the initial and boundary conditions' parameters.

Downward continuation of airborne geomagnetic data based on two iterative regularization methods in the frequency domain

Downward continuation is a key step in processing airborne geomagnetic data. However,downward continuation is a typically ill-posed problem because its computation is unstable; thus, regularization methods are needed to realize effective continuation. According to the Poisson integral plane approximate relationship between observation and continuation data, the computation formulae combined with the fast Fourier transform（FFT）algorithm are transformed to a frequency domain for accelerating the computational speed. The iterative Tikhonov regularization method and the iterative Landweber regularization method are used in this paper to overcome instability and improve the precision of the results. The availability of these two iterative regularization methods in the frequency domain is validated by simulated geomagnetic data, and the continuation results show good precision.

REGULARIZATION OF PLANAR VORTICES FOR THE INCOMPRESSIBLE FLOW

In this paper, we continue to construct stationary classical solutions for the incompressible planar flows approximating singular stationary solutions of this problem. This procedure is carried out by constructing solutions for the following elliptic equations{-△u=λ∑1Bδ（x0,j）（u-kj）p＋,in Ω,u=0,onΩ is a bounded simply-connected smooth domain, ki （i = 1,… , k） is prescribed positive constant. The result we prove is that for any given non-degenerate critical pointX0=（x0,1,…,x0,k of the Kirchhoff-Routh function defined on Ωk corresponding to （ k1,……kk ）there exists a stationary classical solution approximating stationary k points vortex solution. Moreover, as λ→＋∞ shrinks to {x05}, and the local vorticity strength near each x0,j approaches kj, j = 1,… , k. This result makes the study of the above problem with p _〉 0 complete since the cases p 〉 1, p = 1, p = 0 have already been studied in [11, 12] and [13] respectively.

Some studies on the Tikhonov regularization method with additional assumptions for noise data

In this paper, the Tikhonov regularization method was used to solve the nondegenerate compact hnear operator equation, which is a well-known ill-posed problem. Apart from the usual error level, the noise data were supposed to satisfy some additional monotonic condition. Moreover, with the assumption that the singular values of operator have power form, the improved convergence rates of the regularized solution were worked out.

REGULARIZATION METHODS FOR NONLINEAR ILL-POSED PROBLEMS WITH ACCRETIVE OPERATORS

This article is devoted to the regularization of nonlinear ill-posed problems with accretive operators in Banach spaces. The data involved are assumed to be known approximately. The authors concentrate their discussion on the convergence rates of regular solutions.

Bathymetry inversion using the modifi ed gravitygeologic method:application of the rectangular prism model and Tikhonov regularization

Bathymetry data are usually obtained via single-beam or multibeam sounding;however,these methods exhibit low efficiency and coverage and are dependent on various parameters,including the condition of the vessel and sea state.To overcome these limitations,we propose a method for marine bathymetry inversion based on the satellite altimetry gravity anomaly data as a modification of the gravity-geologic method(GGM),which is a conventional terrain inversion method based on gravity data.In accordance with its principle,the modified method adopts a rectangular prism model for modeling the short-wavelength gravity anomaly and the Tikhonov regularization method to integrate the geophysical constraints,including the a priori water depth data and characteristics of the sea bottom relief.The a priori water depth data can be obtained based on the measurement data obtained from a ship,borehole information,etc.,and the existing bathymetry/terrain model can be considered as the initial model.Marquardt’s method is used during the inversion process,and the regularization parameter can be adaptively determined.The model test and application to the West Philippine Basin indicate the feasibility and eff ectiveness of the proposed method.The results indicate the capability of the proposed method to improve the overall accuracy of the water depth data.Then,the proposed method can be used to conduct a preliminary study of the ocean depths.Additionally,the results show that in the improved GGM,the density diff erence parameter has lost its original physical meaning,and it will not have a great impact on the inversion process.Based on the boundedness of the study area,the inversion result may exhibit a lower confi dence level near the margin than that near the center.Furthermore,the modifi ed GGM is time-and memory-intensive when compared with the conventional GGM.

ITERATIVE REGULARIZATION METHODS FOR NONLINEAR ILL-POSED OPERATOR EQUATIONS WITH M-ACCRETIVE MAPPINGS IN BANACH SPACES

In this paper, a modified Newton type iterative method is considered for ap- proximately solving ill-posed nonlinear operator equations involving m-accretive mappings in Banach space. Convergence rate of the method is obtained based on an a priori choice of the regularization parameter. Our analysis is not based on the sequential continuity of the normalized duality mapping.

Image decomposition using adaptive regularization and div(BMO)

In order to avoid staircasing effect and preserve small scale texture information for the classical total variation regularization, a new minimization energy functional model for image decomposition is proposed. Firstly, an adaptive regularization based on the local feature of images is introduced to substitute total variational regularization. The oscillatory component containing texture and/or noise is modeled in generalized function space div （BMO）. And then, the existence and uniqueness of the minimizer for proposed model are proved. Finally, the gradient descent flow of the Euler-Lagrange equations for the new model is numerically implemented by using a finite difference method. Experiments show that the proposed model is very robust to noise, and the staircasing effect is avoided efficiently, while edges and textures are well remained.