期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到18篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
NON-INTERIOR SMOOTHING ALGORITHM FOR FRICTIONAL CONTACT PROBLEMS 认领 引用 被引量：1
1
作者 张洪武 何素艳 李兴斯 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2004年第1期47-58,共12页
A new algorithm for solving the three-dimensional elastic contact problem with friction is presented. The algorithm is a non-interior smoothing algorithm based on an NCP-function. The parametric variational principle ... A new algorithm for solving the three-dimensional elastic contact problem with friction is presented. The algorithm is a non-interior smoothing algorithm based on an NCP-function. The parametric variational principle and parametric quadratic programming method were applied to the analysis of three-dimensional frictional contact problem. The solution of the contact problem was finally reduced to a linear complementarity problem, which was reformulated as a system of nonsmooth equations via an NCP-function. A smoothing approximation to the nonsmooth equations was given by the aggregate function. A Newton method was used to solve the resulting smoothing nonlinear equations. The algorithm presented is easy to understand and implement. The reliability and efficiency of this algorithm are demonstrated both by the numerical experiments of LCP in mathematical way and the examples of contact problems in mechanics. 展开更多
关键词 three-dimensional frictional contact problem parametic quadratic programming method linear complementarity problem NCP-function aggregate function non-interior smoothing algorithm
暂未订购 下载PDF
Dual smoothing ionospheric gradient monitoring algorithm for dual-frequency BDS GBAS 认领 引用 被引量：4
2
作者 Zhipeng WANG Yu YIN +3 位作者 Dan SONG Kun FANG Qiang LI Xiao LI 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2020年第12期3395-3404,共10页
In this study,a Dual Smoothing Ionospheric Gradient Monitor Algorithm(DSIGMA)was developed for Code-Carrier Divergence(CCD)faults of dual-frequency Ground-Based Augmentation Systems(GBAS)based on the Bei Dou Navigatio... In this study,a Dual Smoothing Ionospheric Gradient Monitor Algorithm(DSIGMA)was developed for Code-Carrier Divergence(CCD)faults of dual-frequency Ground-Based Augmentation Systems(GBAS)based on the Bei Dou Navigation Satellite System(BDS).Divergence-Free(DF)combinations of the signals were used to form test statistics for a dualfrequency DSIGMA.First,the single-frequency DSIGMA was reviewed,which supports the GBAS approach service type D(GAST-D)for protection against the effect of large ionospheric gradients.The single-frequency DSIGMA was used to create a novel input scheme for the dual-frequency DSIGMA by introducing DF combinations.The steady states of the test statistics were also analysed.The monitors were characterized using BDS measurement data,whereby standard deviations of 0.0432 and 0.0639 m for the proposed two test statistics were used to calculate the monitor threshold.An extensive simulation was designed to assess the monitor performance by comparing the Probability of Missed Detection(PMD)according to the differential error with the range domain PMD limits under different fault modes.The results showed that the proposed algorithm has a higher integrity performance than the single-frequency monitor.The minimum detectable divergence with the same missed probability is less than 50%that of GAST-D. 展开更多
关键词 Approach Augmentation Integrity Ionosphere-monitoring Satellite navigation Smoothing algorithms Steady state Threshold
暂未订购 下载PDF
Smoothing Newton Algorithm for Linear Programming over Symmetric Cones 认领 引用 被引量：3
3
作者 刘晓红 倪铁 《Transactions of Tianjin University》 EI CAS 2009年第3期216-221,共6页
By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algor... By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algorithm is globally convergent under suitable assumptions. 展开更多
关键词 linear programming symmetric cone Euclidean Jordan algebra smoothing algorithm
暂未订购 下载PDF
Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search 认领 引用 被引量：12
4
作者 HUANG ZhengHai HU ShengLong HAN JiYe 《Science China Mathematics》 2009年第4期833-848,共16页
In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally conv... In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally convergent under an assumption that the solution set of the problem concerned is nonempty. Such an assumption is weaker than those given in most existing algorithms for solving optimization problems over symmetric cones. We also prove that the solution obtained by the algorithm is a maximally complementary solution to the monotone SCCP under some assumptions. 展开更多
关键词 complementarity problem symmetric cone Euclidean Jordan algebra smoothing algorithm global convergence 90C25 90C33
暂未订购 下载PDF
Smoothing Newton Algorithm for Solving Generalized Complementarity Problem 认领 引用
5
作者 刘晓红 倪铁 《Transactions of Tianjin University》 EI CAS 2010年第1期75-79,共5页
The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing... The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing Newton-type algorithm is proposed for solving the generalized complementarity problem.Under suitable assumptions, the proposed algorithm is well-defined and global convergent. 展开更多
关键词 generalized complementarity problem smoothing Newton algorithm NCP function global convergence
暂未订购 下载PDF
Smoothing Newton Algorithm for Nonlinear Complementarity Problem with a PFunction 认领 引用
6
作者 刘丹红 黄涛 王萍 《Transactions of Tianjin University》 EI CAS 2007年第5期379-386,共8页
By using a smoothing function,the P nonlinear complementarity problem(P NCP)can be reformulated as a parameterized smooth equation.A Newton method is proposed to solve this equation.The iteration sequence generated by... By using a smoothing function,the P nonlinear complementarity problem(P NCP)can be reformulated as a parameterized smooth equation.A Newton method is proposed to solve this equation.The iteration sequence generated by the proposed algorithm is bounded and this algorithm is proved to be globally convergent under an assumption that the P NCP has a nonempty solution set.This assumption is weaker than the ones used in most existing smoothing algorithms.In particular,the solution obtained by the proposed algorithm is shown to be a maximally complementary solution of the P NCP without any additional assumption. 展开更多
关键词 P.nonlinear complementarity problem smoothing Newton algorithm maximally complementary solution
暂未订购 下载PDF
Solving frictional contact problems by two aggregate-function-based algorithms 认领 引用
7
作者 Suyan He Hongwu Zhang Xingsi Li 《Acta Mechanica Sinica》 SCIE EI CAS 2005年第5期467-471,共5页
Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problem... Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problems are proposed. One is called the self-adjusting interior point algorithm, the other is called the aggregate function smoothing algorithm. Numerical experiment shows the efficiency of the proposed two algorithms. 展开更多
关键词 Frictional contact problem. Linear complementarity problem .Aggregate function ~ Interior pointalgorithm ~ Smoothing algorithm
暂未订购 下载PDF
Variable structure multiple model fixed-interval smoothing 认领 引用 被引量：4
8
作者 Bolun ZHANG Yongxin GAO Zhansheng DUAN 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2023年第2期139-148,共10页
This paper focuses on fixed-interval smoothing for stochastic hybrid systems.When the truth-mode mismatch is encountered,existing smoothing methods based on fixed structure of model-set have significant performance de... This paper focuses on fixed-interval smoothing for stochastic hybrid systems.When the truth-mode mismatch is encountered,existing smoothing methods based on fixed structure of model-set have significant performance degradation and are inapplicable.We develop a fixedinterval smoothing method based on forward-and backward-filtering in the Variable Structure Multiple Model(VSMM)framework in this paper.We propose to use the Simplified Equivalent model Interacting Multiple Model(SEIMM)in the forward and the backward filters to handle the difficulty of different mode-sets used in both filters,and design a re-filtering procedure in the model-switching stage to enhance the estimation performance.To improve the computational efficiency,we make the basic model-set adaptive by the Likely-Model Set(LMS)algorithm.It turns out that the smoothing performance is further improved by the LMS due to less competition among models.Simulation results are provided to demonstrate the better performance and the computational efficiency of our proposed smoothing algorithms. 展开更多
关键词 Fixed-interval smoothing Model-set adaptation Multiple model estimation Smoothing algorithm Variable structure
暂未订购 下载PDF
Parameter Estimation of RBF-AR Model Based on the EM-EKF Algorithm 认领 引用 被引量：6
9
作者 Yanhui Xi Hui Peng Hong Mo 《自动化学报》 EI CAS CSCD 北大核心 2017年第9期1636-1643,共8页
RBF-AR （radial basis function network-based autoregressive） model is reconstructed as a new type of general radial basis function （RBF） neural network, which has additional linear output weight layer in comparison... RBF-AR （radial basis function network-based autoregressive） model is reconstructed as a new type of general radial basis function （RBF） neural network, which has additional linear output weight layer in comparison with the traditional three-layer RBF network. The extended Kalman filter （EKF） algorithm for RBF training has low filtering accuracy and divergence because of unknown prior knowledge, such as noise covariance and initial states. To overcome the drawback, the expectation maximization （EM） algorithm is used to estimate the covariance matrices of noises and the initial states. The proposed method, called the EM-EKF （expectation-maximization extended Kalman filter） algorithm, which combines the expectation maximization, extended Kalman filtering and smoothing process, is developed to estimate the parameters of the RBF-AR model, the initial conditions and the noise variances simultaneously. It is shown by the simulation tests that the EM-EKF method for the reconstructed RBF-AR network provides better results than structured nonlinear parameter optimization method （SNPOM） and the EKF, especially in low SNR （signal noise ratio）. Moreover, the EM-EKF method can accurately estimate the noise variance. F test indicates there is significant difference between results obtained by the SNPOM and the EM-EKF. 展开更多
关键词 Expectation maximization （EM） algorithm, extended Kalman filtering （EKF） and smoothing, radial basis function（RBF） neural network, RBF-AR model
暂未订购 下载PDF
FURTHER STUDY ON A DUAL ALGORITHM 认领 引用
10
作者 HeSuxiang HanHua 《Applied Mathematics(A Journal of Chinese Universities)》 2005年第2期243-251,共9页
The dual algorithm for minimax problems is further studied in this paper.The resulting theoretical analysis shows that the condition number of the corresponding Hessian of the smooth modified Lagrange function with ch... The dual algorithm for minimax problems is further studied in this paper.The resulting theoretical analysis shows that the condition number of the corresponding Hessian of the smooth modified Lagrange function with changing parameter in the dual algorithm is proportional to the reciprocal of the parameter,which is very important for the efficiency of the dual algorithm.At last,the numerical experiments are reported to validate the analysis results. 展开更多
关键词 dual algorithm,smooth modified Lagrange function condition number,numerical result.
暂未订购 下载PDF
A NON-MONOTONE SMOOTHING NEWTON ALGORITHM FOR SOLVING THE SYSTEM OF GENERALIZED ABSOLUTE VALUE EQUATIONS 认领 引用
11
作者 Cairong Chen Dongmei Yu +1 位作者 Deren Han Changfeng Ma 《Journal of Computational Mathematics》 SCIE CSCD 2025年第2期438-460,共23页
The system of generalized absolute value equations(GAVE)has attracted more and more attention in the optimization community.In this paper,by introducing a smoothing function,we develop a smoothing Newton algorithm wit... The system of generalized absolute value equations(GAVE)has attracted more and more attention in the optimization community.In this paper,by introducing a smoothing function,we develop a smoothing Newton algorithm with non-monotone line search to solve the GAVE.We show that the non-monotone algorithm is globally and locally quadratically convergent under a weaker assumption than those given in most existing algorithms for solving the GAVE.Numerical results are given to demonstrate the viability and efficiency of the approach. 展开更多
关键词 Generalized absolute value equations Smoothing function Smoothing Newton algorithm Non-monotone line search Global and local quadratic convergence
暂未订购 下载PDF
EXTENSION OF SMOOTHING NEWTON ALGORITHMS TO SOLVE LINEAR PROGRAMMING OVER SYMMETRIC CONES 认领 引用 被引量：3
12
作者 Zhenghai HUANG Xiaohong LIU 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2011年第1期195-206,共12页
There recently has been much interest in studying some optimization problems over symmetric cones.This paper deals with linear programming over symmetric cones(SCLP).The objective here is to extend the Qi-Sun-Zhou'... There recently has been much interest in studying some optimization problems over symmetric cones.This paper deals with linear programming over symmetric cones(SCLP).The objective here is to extend the Qi-Sun-Zhou's smoothing Newton algorithm to solve SCLP,where characterization of symmetric cones using Jordan algebras forms the fundamental basis for our analysis.By using the theory of Euclidean Jordan algebras,the authors show that the algorithm is globally and locally quadratically convergent under suitable assumptions.The preliminary numerical results for solving the second-order cone programming are also reported. 展开更多
关键词 Euclidean Jordan algebra linear programming smoothing algorithm symmetric cone.
暂未订购 下载PDF
An Improved Unsupervised Approach to Word Segmentation 认领 引用
13
作者 WANG Hanshi HAN Xuhong +2 位作者 LIU Lizhen SONG Wei YUAN Mudan 《China Communications》 SCIE CSCD 2015年第7期82-95,共14页
ESA is an unsupervised approach to word segmentation previously proposed by Wang, which is an iterative process consisting of three phases: Evaluation, Selection and Adjustment. In this article, we propose Ex ESA, the... ESA is an unsupervised approach to word segmentation previously proposed by Wang, which is an iterative process consisting of three phases: Evaluation, Selection and Adjustment. In this article, we propose Ex ESA, the extension of ESA. In Ex ESA, the original approach is extended to a 2-pass process and the ratio of different word lengths is introduced as the third type of information combined with cohesion and separation. A maximum strategy is adopted to determine the best segmentation of a character sequence in the phrase of Selection. Besides, in Adjustment, Ex ESA re-evaluates separation information and individual information to overcome the overestimation frequencies. Additionally, a smoothing algorithm is applied to alleviate sparseness. The experiment results show that Ex ESA can further improve the performance and is time-saving by properly utilizing more information from un-annotated corpora. Moreover, the parameters of Ex ESA can be predicted by a set of empirical formulae or combined with the minimum description length principle. 展开更多
关键词 word segmentation character sequence smoothing algorithm maximum strategy
暂未订购 下载PDF
Wireless distributed computing for cyclostationary feature detection 认领 引用 被引量：2
14
作者 Mohammed I.M. Alfaqawi Jalel Chebil +1 位作者 Mohamed Hadi Habaebi Dinesh Datla 《Digital Communications and Networks》 2016年第1期46-55,共10页
Recently, wireless distributed computing （WDC） concept has emerged promising manifolds improvements to current wireless technotogies. Despite the various expected benefits of this concept, significant drawbacks were... Recently, wireless distributed computing （WDC） concept has emerged promising manifolds improvements to current wireless technotogies. Despite the various expected benefits of this concept, significant drawbacks were addressed in the open literature. One of WDC key challenges is the impact of wireless channel quality on the load of distributed computations. Therefore, this research investigates the wireless channel impact on WDC performance when the tatter is applied to spectrum sensing in cognitive radio （CR） technology. However, a trade- off is found between accuracy and computational complexity in spectrum sensing approaches. Increasing these approaches accuracy is accompanied by an increase in computational complexity. This results in greater power consumption and processing time. A novel WDC scheme for cyclostationary feature detection spectrum sensing approach is proposed in this paper and thoroughly investigated. The benefits of the proposed scheme are firstly presented. Then, the impact of the wireless channel of the proposed scheme is addressed considering two scenarios. In the first scenario, workload matrices are distributed over the wireless channel 展开更多
关键词 Cotnttive radio Spectrum sensing Cyclostattonary feature detection FFT time smoothing algorithms Wireless distributed computing
暂未订购 下载PDF
A Homogeneous Smoothing-type Algorithm for Symmetric Cone Linear Programs 认领 引用
15
作者 Wei-Zhe GU Zheng-Hai HUANG 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2014年第3期647-662,共16页
In this paper, we investigate a smoothing-type algorithm for solving the symmetric cone linear program （（SCLP） for short） by making use of an augmented system of its optimality conditions. The algorithm only needs... In this paper, we investigate a smoothing-type algorithm for solving the symmetric cone linear program （（SCLP） for short） by making use of an augmented system of its optimality conditions. The algorithm only needs to solve one system of linear equations and to perform one line search at each iteration. It is proved that the algorithm is globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, the algorithm may correctly detect solvability of （SCLP）. Furthermore, if （SCLP） has a solution, then the algorithm will generate a solution of （SCLP）, and if the problem is strongly infeasible, the algorithm will correctly detect infeasibility of （SCLP）. 展开更多
关键词 linear program symmetric cone Euclidean Jordan algebra smoothing algorithm global conver-gence
暂未订购 下载PDF
Multi-UAV Route Re-Generation Method Based on Trajectory Data 认领 引用
16
作者 YUAN DONGDONG WANG HANKAI BAI JIAQI 《Journal of Shanghai Jiaotong university(Science)》 EI 2022年第6期806-816,共11页
A large quantity of unmanned aerial vehicle(UAV)trajectory data related to air traffic information has important value in engineering fields.However,the cost of data and trajectory processing limits the applications,a... A large quantity of unmanned aerial vehicle(UAV)trajectory data related to air traffic information has important value in engineering fields.However,the cost of data and trajectory processing limits the applications,and as the number of UAVs increases rapidly,future UAVs'path data will be very large.Therefore,this paper designs a multi-UAV route re-generation method based on trajectory data,which can realize the UAVs'path data compression,de-aggregation,and regeneration tasks.Based on the trajectory data,the three-dimensional Douglas-Peucker algorithm is used to compress the trajectory data to reduce the storage space.The improved B-spline path smoothing algorithm based on the reversing control point is used to depolymerize and smooth the path.Simulation experiments show that the above multi-UAV route re-generation algorithm can obtain a more optimized path while maintaining the important characteristics of the original path. 展开更多
关键词 unmanned aerial vehicle(UAV) trajectory data route re-generation three-dimensional Douglas-Peucker algorithm improved B-spline path smoothing algorithm reversing control point
暂未订购 下载PDF
Optimized Design for the Plow of a Submarine Plowing Trencher 认领 引用 被引量：1
17
作者 Hanyang Gong Ruhua Yuan +3 位作者 Xiaodong Xing Liquan Wang Zhipeng Wang Haixia Gong 《Journal of Marine Science and Application》 2013年第1期98-105,共8页
The plow of the submarine plowing trencher is one of the main functional mechanisms, and its optimization is very important. The design parameters play a very significant role in determining the requirements of the to... The plow of the submarine plowing trencher is one of the main functional mechanisms, and its optimization is very important. The design parameters play a very significant role in determining the requirements of the towing force of a vessel. A multi-objective genetic algorithm based on analytical models of the plow surface has been examined and applied in efforts to obtain optimal design of the plow. For a specific soil condition, the draft force and moldboard surface area which are the key parameters in the working process of the plow are optimized by finding the corresponding optimal values of the plow blade penetration angle and two surface angles of the main cutting blade of the plow. Parameters such as the moldboard side angle of deviation, moldboard lift angle, angular variation of the tangent line, and the spanning length are also analyzed with respect to the force of the moldboard surface along soil flow direction. Results show that the optimized plow has an improved plow performance. The draft forces of the main cutting blade and the moldboard are 10.6% and 7%, respectively, less than the original design. The standard deviation of Gaussian curvature of moldboard is lowered by 64.5%, which implies that the smoothness of the optimized moldboard surface is much greater than the original. 展开更多
关键词 submarine plowing trencher moldboard surface plow surface optimized design multi-objective genetic algorithm surface smoothness
暂未订购 下载PDF
Post-stack seismic data denoising via MABCDT-Curvelet transform 认领 引用
18
作者 Niu Chaoyi Huang Xuri +3 位作者 Yan Shengyuan Chen Xiaochun Wo Yukai Ma An 《Journal of Geophysical Prospecting》 2025年第3期286-297,共12页
Noise in post-stack seismic data can severely interfere with the identification and interpretation of reflection signals, making efficient denoising essential for improving the accuracy of seismic data interpretation.... Noise in post-stack seismic data can severely interfere with the identification and interpretation of reflection signals, making efficient denoising essential for improving the accuracy of seismic data interpretation. Owing to its superior multi-scale and multi-directional characteristics, curvelet transform has been widely adopted for post-stack data denoising. However, conventional curvelet transform tends to produce pseudo-Gibbs effects at boundaries, which leads to edge oscillations and spurious reflections. In addition, aggressive noise suppression often results in the loss of valid signals, which limits the practical applicability of these methods. To address these challenges, this paper proposes a curvelet transform approach incorporating multi-scale adaptive block curveletdomain thresholding(MABCDT). First, cycle spinning and MABCDT are introduced in the curvelet domain to enhance the preservation of weak signals and significantly mitigate pseudo-Gibbs phenomena. Then, a fast non-local mean filtering is applied to the data after inverse curvelet transform, which further retains valid signals while removing residual noise. Finally, a directional smoothing diffusion algorithm is introduced, which utilizes gradient direction information to perform directionally weighted smoothing and diffusion, thereby further suppressing noise and enhancing the continuity of valid signals. Both synthetic and field data tests demonstrate that the proposed method outperforms conventional post-stack denoising techniques in terms of signal-to-noise ratio enhancement and waveform fidelity. The method preserves the continuous structural features of seismic signals while suppressing noise and significantly reduces pseudo-Gibbs effects caused by high-frequency truncation. 展开更多
关键词 curvelet transform cycle spinning multi-scale adaptive block curvelet‑domain thresholding(MABCDT) fast non-local means filtering directional smoothing diffusion algorithm weak signal identification
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈