期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3,147篇文章
< 1 2 … 158 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A POSITIVE INTERIOR-POINT ALGORITHM FOR NONLINEAR COMPLEMENTARITY PROBLEMS 认领 引用
1
作者 马昌凤 梁国平 陈新美 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2003年第3期355-362,共8页
A new iterative method,which is called positive interior-point algorithm,is presented for solving the nonlinear complementarity problems.This method is of the desirable feature of robustness.And the convergence theore... A new iterative method,which is called positive interior-point algorithm,is presented for solving the nonlinear complementarity problems.This method is of the desirable feature of robustness.And the convergence theorems of the algorithm is established.In addition,some numerical results are reported. 展开更多
关键词 nonlinear complementarity problems positive interior-point algorithm non-smooth equations
暂未订购 下载PDF
Structural Reliability Analysis Based on Differential Evolution Algorithm and Hypersphere Integration 认领 引用
2
作者 CHEN Zhenzhong HAN Zhuo +4 位作者 WANG Peiyu PAN Qianghua LI Xiaoke GAN Xuehui CHEN Ge 《Journal of Donghua University(English Edition)》 CAS 2026年第1期118-130,共13页
In reliability analyses,the absence of a priori information on the most probable point of failure(MPP)may result in overlooking critical points,thereby leading to biased assessment outcomes.Moreover,second-order relia... In reliability analyses,the absence of a priori information on the most probable point of failure(MPP)may result in overlooking critical points,thereby leading to biased assessment outcomes.Moreover,second-order reliability methods exhibit limited accuracy in highly nonlinear scenarios.To overcome these challenges,a novel reliability analysis strategy based on a multimodal differential evolution algorithm and a hypersphere integration method is proposed.Initially,the penalty function method is employed to reformulate the MPP search problem as a conditionally constrained optimization task.Subsequently,a differential evolution algorithm incorporating a population delineation strategy is utilized to identify all MPPs.Finally,a paraboloid equation is constructed based on the curvature of the limit-state function at the MPPs,and the failure probability of the structure is calculated by using the hypersphere integration method.The localization effectiveness of the MPPs is compared through multiple numerical cases and two engineering examples,with accuracy comparisons of failure probabilities against the first-order reliability method(FORM)and the secondorder reliability method(SORM).The results indicate that the method effectively identifies existing MPPs and achieves higher solution precision. 展开更多
关键词 reliability analysis design point positioning differential evolution algorithm hypersphere integration
暂未订购 下载PDF
A Full-Newton Step Feasible Interior-Point Algorithm for the Special Weighted Linear Complementarity Problems Based on Algebraic Equivalent Transformation 认领 引用
3
作者 Jing GE Mingwang ZHANG Panjie TIAN 《Journal of Mathematical Research with Applications》 CSCD 2025年第4期555-568,共14页
In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transform... In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm. 展开更多
关键词 interior-point algorithm weighted linear complementarity problem algebraic equivalent transformation search direction iteration complexity
暂未订购 下载PDF
Two Structure-Preserving-Doubling Like Algorithms to Solve the Positive Definite Solution of the Equation X-AHX-1A=Q 认领 引用 被引量：1
4
作者 Xiao-Xia Guo Hong-Xiao Wu 《Communications on Applied Mathematics and Computation》 EI 2021年第1期123-135,共13页
In this paper,we study the nonlinear matrix equation X-AHX-1A=Q,where A,Q∈Cn×n,Q is a Hermitian positive definite matrix and X∈Cn×nis an unknown matrix.We prove that the equation always has a u... In this paper,we study the nonlinear matrix equation X-AHX-1A=Q,where A,Q∈Cn×n,Q is a Hermitian positive definite matrix and X∈Cn×nis an unknown matrix.We prove that the equation always has a unique Hermitian positive definite solution.We present two structure-preserving-doubling like algorithms to find the Hermitian positive definite solution of the equation,and the convergence theories are established.Finally,we show the effectiveness of the algorithms by numerical experiments. 展开更多
关键词 Positive definite solution Structure-preserving-doubling like algorithm Convergence Numerical experiment
暂未订购 下载PDF
Heuristic Reduction Algorithm Based on Pairwise Positive Region 认领 引用
5
作者 祁立 刘玉树 《Journal of Beijing Institute of Technology》 EI CAS 2007年第3期295-299,共5页
To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region ... To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region is defined, based on which the pairwise significance measure is calculated between the members of each pair classes. Finally the weighted pairwise significance of attribute is used as the attribute reduction criterion, which indicates the necessity of attributes very well. By introducing the noise tolerance factor, the new algorithm can tolerate noise to some extent. Experimental results show the advantages of our novel heuristic reduction algorithm over the traditional attribute dependency based algorithm. 展开更多
关键词 rough set pairwise positive region heuristic reduction algorithm
暂未订购 下载PDF
A POLYNOMIAL PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING 认领 引用 被引量：6
6
作者 余谦 黄崇超 江燕 《Acta Mathematica Scientia》 SCIE 2006年第2期265-270,共6页
This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one c... This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one corrector step after each predictor step, where Step 2 is a predictor step and Step 4 is a corrector step in the algorithm. In the algorithm, the predictor step decreases the dual gap as much as possible in a wider neighborhood of the central path and the corrector step draws iteration points back to a narrower neighborhood and make a reduction for the dual gap. It is shown that the algorithm has O（√nL） iteration complexity which is the best result for convex quadratic programming so far. 展开更多
关键词 Convex quadratic programming predictor-corrector interior-point algorithm
暂未订购 下载PDF
A Full-Newton Step Feasible Interior-Point Algorithm for the Special Weighted Linear Complementarity Problems Based on a Kernel Function 认领 引用 被引量：2
7
作者 GENG Jie ZHANG Mingwang ZHU Dechun 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2024年第1期29-37,共9页
In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear ... In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method. 展开更多
关键词 interior-point algorithm weighted linear complementarity problem full-Newton step kernel function iteration complexity
暂未订购 下载PDF
Coordinate correction algorithm for WLAN indoor positioning 认领 引用 被引量：1
8
作者 孙永亮 徐玉滨 +1 位作者 马琳 韩军义 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2012年第2期67-70,共4页
In the fingerprint matching-based wireless local area network(WLAN) indoor positioning system,Kalman filter(KF) is usually applied after fingerprint matching algorithms to make positioning results more accurate and co... In the fingerprint matching-based wireless local area network(WLAN) indoor positioning system,Kalman filter(KF) is usually applied after fingerprint matching algorithms to make positioning results more accurate and consecutive.But this method,like most methods in WLAN indoor positioning field,fails to consider and make use of users' moving speed information.In order to make the positioning results more accurate through using the users' moving speed information,a coordinate correction algorithm(CCA) is proposed in this paper.It predicts a reasonable range for positioning coordinates by using the moving speed information.If the real positioning coordinates are not in the predicted range,it means that the positioning coordinates are not reasonable to a moving user in indoor environment,so the proposed CCA is used to correct this kind of positioning coordinates.The simulation results prove that the positioning results by the CCA are more accurate than those calculated by the KF and the CCA is effective to improve the positioning performance. 展开更多
关键词 indoor positioning fingerprint matching Kalman filter coordinate correction algorithm
暂未订购 下载PDF
Optimization of MAC algorithm based on IEEE 802.15.4 in indoor positioning system 认领 引用 被引量：2
9
作者 Sun Guanyu Qin Danyang Lan Tingting 《High Technology Letters》 EI CAS 2021年第1期86-94,共9页
The mobility of the targets asks for high requirements of the locating speed in indoor positioning systems.The standard medium access control(MAC)algorithm will often cause lots of packet conflicts and high transmissi... The mobility of the targets asks for high requirements of the locating speed in indoor positioning systems.The standard medium access control(MAC)algorithm will often cause lots of packet conflicts and high transmission delay if multiple users communicate with one beacon at the same time,which will severely limit the speed of the system.Therefore,an optimized MAC algorithm is proposed based on channel reservation to enable users to reserve beacons.A frame threshold is set to ensure the users with shorter data frames do not depend on the reservation mechanism,and multiple users can achieve packets switching with relative beacon in a fixed sequence by using frequency division multiplexing technology.The simulation results show that the optimized MAC algorithm proposed in this paper can improve the positioning speed significantly while maintaining the positioning accuracy.Moreover,the positioning accuracy can be increased to a certain extent if more channel resources can be obtained,so as to provide effective technical support for the location and tracking applications of indoor moving targets. 展开更多
关键词 medium access control(MAC)algorithm indoor positioning multi-channel fingerprint identification IEEE 802.15.4
暂未订购 下载PDF
New Distributed Positioning Algorithm Based on Centroid of Circular Belt for Wireless Sensor Networks 认领 引用 被引量：1
10
作者 Xu-Zhi Lai Simon X. Yang +2 位作者 Gui-Xiu Zeng Jin-Hua She Min Wu 《International Journal of Automation and computing》 2007年第3期315-324,共10页
This paper presents a new distributed positioning algorithm for unknown nodes in a wireless sensor network. The algorithm is based exclusively on connectivity. First, assuming that the positions of the anchor nodes ar... This paper presents a new distributed positioning algorithm for unknown nodes in a wireless sensor network. The algorithm is based exclusively on connectivity. First, assuming that the positions of the anchor nodes are already known, a circular belt containing an unknown node is obtained using information about the anchor nodes that are in radio range of the unknown node, based on the geometric relationships and communication constraints among the unknown node and the anchor nodes. Then, the centroid of the circular belt is taken to be the estimated position of the unknown node. Since the algorithm is very simple and since the only communication needed is between the anchor nodes and the unknown node, the communication and computational loads are very small. Furthermore, the algorithm is robust because neither the failure of old unknown nodes nor the addition of new unknown nodes influences the positioning of unknown nodes to be located. A theoretical analysis and simulation results show that the algorithm does not produce any cumulative error and is insensitive to range error, and that a change in the number of sensor nodes does not affect the communication or computational load. These features make this algorithm suitable for all sizes of low-power wireless sensor networks. 展开更多
关键词 Positioning wireless sensor networks circular belt algorithm performance.
暂未订购 下载PDF
A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization 认领 引用 被引量：1
11
作者 张敏 白延琴 王国强 《Journal of Shanghai University(English Edition)》 2008年第6期475-480,共6页
In this paper, a primal-dual path-following interior-point algorithm for linearly constrained convex optimization(LCCO) is presented.The algorithm is based on a new technique for finding a class of search directions a... In this paper, a primal-dual path-following interior-point algorithm for linearly constrained convex optimization(LCCO) is presented.The algorithm is based on a new technique for finding a class of search directions and the strategy of the central path.At each iteration, only full-Newton steps are used.Finally, the favorable polynomial complexity bound for the algorithm with the small-update method is deserved, namely, O(√n log n /ε). 展开更多
关键词 linearly constrained convex optimization （LCCO） interior-point algorithm small-update method polynomial complexity
暂未订购 下载PDF
Positioning performance analysis of the time sum of arrival algorithm with error features 认领 引用 被引量：1
12
作者 宫峰勋 马艳秋 《Optoelectronics Letters》 EI 2018年第2期133-137,共5页
The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location ... The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location performance of the time sum of arrival(TSOA) algorithm from the root mean square error(RMSE) and geometric dilution of precision(GDOP) in additive white Gaussian noise(AWGN) environment. The TSOA localization model is constructed. Using it, the distribution of location ambiguity region is presented with 4-base stations. And then, the location performance analysis is started from the 4-base stations with calculating the RMSE and GDOP variation. Subsequently, when the location parameters are changed in number of base stations, base station layout and so on, the performance changing patterns of the TSOA location algorithm are shown. So, the TSOA location characteristics and performance are revealed. From the RMSE and GDOP state changing trend, the anti-noise performance and robustness of the TSOA localization algorithm are proved. The TSOA anti-noise performance will be used for reducing the blind-zone and the false location rate of MLAT systems. 展开更多
关键词 Positioning performance analysis of the time sum of arrival algorithm with error features
暂未订购 下载PDF
Ocean bottom seismograph relocation and time correction using the MCMC algorithm 认领 引用 被引量：1
13
作者 Hao Hu Xiongwei Niu +6 位作者 Wei Wang Wencai Xu Aiguo Ruan Wenfei Gong Xiaodong Wei Mingju Xu Tao Li 《Acta Oceanologica Sinica》 SCIE CAS CSCD 2025年第10期101-111,共11页
The ocean bottom seismograph(OBS)is a powerful device deployed on the seafloor for acquiring marine seismic data,capable of detecting the multi-scale Earth’s interiors from submarine sediments to the mantle.Due to th... The ocean bottom seismograph(OBS)is a powerful device deployed on the seafloor for acquiring marine seismic data,capable of detecting the multi-scale Earth’s interiors from submarine sediments to the mantle.Due to the frequent use of free-fall deployment,it is challenging to accurately track its precise position.Additionally,the internal crystal oscillator clock of the OBS has limited accuracy,resulting in clock drift for long-term work on the seabed.To improve the reliability of OBS detections,it is crucial to calculate the precise OBS location and time correction.Focusing on accurately determining OBS position and timing,this study developed a positioning method that integrates time correction based on the Markov Chain Monte Carlo(MCMC)algorithm,utilizing travel times of direct water waves triggered by two-dimensional(2-D)shot lines or three-dimensional(3-D)airgun arrays.This newly developed method can simultaneously estimate accurate OBS location and time correction,incorporating bathymetric data into the inversion procedures to improve sampling efficiency and enhance the reliability of the final results.Synthetic tests with appropriate noise levels are performed independently to evaluate the feasibility and reliability of our method,indicating that it is robust enough to determine OBS location and time correction precisely.Finally,we use travel-time data recorded at three OBSs deployed in the Southwest Indian Ridge to relocate locations and calculate time corrections.The results exhibit high consistency when using 2-D and 3-D shot data,indicating that high-resolution bathymetric data plays a fingerprint role in inversion to evaluate precise OBS location and time correction. 展开更多
关键词 ocean bottom seismograph positioning time correction marine seismic data acquisition Metropolis-Hastings algorithm marine seismic observation
暂未订购 下载PDF
A tracking algorithm based on adaptive Kalman filter with carrier-to-noise ratio estimation under solar radio bursts interference 认领 引用
14
作者 ZHU Xuefen LI Ang +2 位作者 LUO Yimei LIN Mengying TU Gangyi 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2025年第4期880-891,共12页
Solar radio burst(SRB)is one of the main natural interference sources of Global Positioning System(GPS)signals and can reduce the signal-to-noise ratio(SNR),directly affecting the tracking performance of GPS receivers... Solar radio burst(SRB)is one of the main natural interference sources of Global Positioning System(GPS)signals and can reduce the signal-to-noise ratio(SNR),directly affecting the tracking performance of GPS receivers.In this paper,a tracking algorithm based on the adaptive Kalman filter(AKF)with carrier-to-noise ratio estimation is proposed and compared with the conventional second-order phase-locked loop tracking algo-rithms and the improved Sage-Husa adaptive Kalman filter(SHAKF)algorithm.It is discovered that when the SRBs occur,the improved SHAKF and the AKF with carrier-to-noise ratio estimation enable stable tracking to loop signals.The conven-tional second-order phase-locked loop tracking algorithms fail to track the receiver signal.The standard deviation of the carrier phase error of the AKF with carrier-to-noise ratio estimation out-performs 50.51%of the improved SHAKF algorithm,showing less fluctuation and better stability.The proposed algorithm is proven to show more excellent adaptability in the severe envi-ronment caused by the SRB occurrence and has better tracking performance. 展开更多
关键词 solar radio burst(SRB) global positioning system(GPS) adaptive Kalman filter(AKF) tracking algorithm.
暂未订购 下载PDF
A Wide Neighborhood Arc-Search Interior-Point Algorithm for Convex Quadratic Programming 认领 引用 被引量：2
15
作者 YUAN Beibei ZHANG Mingwang HUANG Zhengwei 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2017年第6期465-471,共7页
In this paper, we propose an arc-search interior-point algorithm for convex quadratic programming with a wide neighborhood of the central path, which searches the optimizers along the ellipses that approximate the ent... In this paper, we propose an arc-search interior-point algorithm for convex quadratic programming with a wide neighborhood of the central path, which searches the optimizers along the ellipses that approximate the entire central path. The favorable polynomial complexity bound of the algorithm is obtained, namely O（nlog（（ x^0）~TS^0/ε）） which is as good as the linear programming analogue. Finally, the numerical experiments show that the proposed algorithm is efficient. 展开更多
关键词 arc-search interior-point algorithm polynomial complexity convex quadratic programming
暂未订购 下载PDF
Interior-Point Algorithm for Linear Optimization Based on a New Kernel Function 认领 引用 被引量：2
16
作者 CHEN Donghai ZHANG Mingwang LI Weihua 《Wuhan University Journal of Natural Sciences》 CAS 2012年第1期12-18,共7页
In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barr... In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions. 展开更多
关键词 linear optimization interior-point algorithms pri- mal-dual methods kernel function polynomial complexity
暂未订购 下载PDF
Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization 认领 引用 被引量：3
17
作者 钱忠根 白延琴 王国强 《Journal of Shanghai University(English Edition)》 2008年第5期388-394,共7页
Interior-point methods （IPMs） for linear optimization （LO） and semidefinite optimization （SDO） have become a hot area in mathematical programming in the last decades. In this paper, a new kernel function with si... Interior-point methods （IPMs） for linear optimization （LO） and semidefinite optimization （SDO） have become a hot area in mathematical programming in the last decades. In this paper, a new kernel function with simple algebraic expression is proposed. Based on this kernel function, a primal-dual interior-point methods （IPMs） for semidefinite optimization （SDO） is designed. And the iteration complexity of the algorithm as O（n^3/4 log n/ε） with large-updates is established. The resulting bound is better than the classical kernel function, with its iteration complexity O（n log n/ε） in large-updates case. 展开更多
关键词 interior-point algorithm primal-dual method semidefinite optimization （SDO） polynomial complexity
暂未订购 下载PDF
NONLINEAR FILTER METHOD OF GPS DYNAMIC POSITIONING BASED ON BANCROFT ALGORITHM 认领 引用 被引量：4
18
作者 ZHANG Qin TAO Ben-zao +1 位作者 ZHAO Chao-ying WANG Li 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2005年第2期170-176,共7页
Because of the ignored items after linearization,the extended Kalman filter(EKF)becomes a form of suboptimal gradient descent algorithm.The emanative tendency exists in GPS solution when the filter equations are ill-p... Because of the ignored items after linearization,the extended Kalman filter(EKF)becomes a form of suboptimal gradient descent algorithm.The emanative tendency exists in GPS solution when the filter equations are ill-posed.The deviation in the estimation cannot be avoided.Furthermore,the true solution may be lost in pseudorange positioning because the linearized pseudorange equations are partial solutions.To solve the above problems in GPS dynamic positioning by using EKF,a closed-form Kalman filter method called the two-stage algorithm is presented for the nonlinear algebraic solution of GPS dynamic positioning based on the global nonlinear least squares closed algorithm--Bancroft numerical algorithm of American.The method separates the spatial parts from temporal parts during processing the GPS filter problems,and solves the nonlinear GPS dynamic positioning,thus getting stable and reliable dynamic positioning solutions. 展开更多
关键词 GPS dynamic positioning Bancroft algorithm extended Kalman filter algorithm
暂未订购 下载PDF
A Dual-Satellite GNSS Positioning Algorithm of High Accuracy in Incomplete Condition 认领 引用 被引量：3
19
作者 Bing Hou Xiaolin Zhang 《China Communications》 SCIE CSCD 2016年第10期58-68,共11页
Global navigation satellite system could provide accurate positioning results in signal complete condition. However, the performance is severe when signal denied, especially for the single-mode Bei Dou receiver. This ... Global navigation satellite system could provide accurate positioning results in signal complete condition. However, the performance is severe when signal denied, especially for the single-mode Bei Dou receiver. This paper proposes a dual-satellite positioning algorithm to promote the positioning performance in the satellite signal gap. The new algorithm utilizes the previous positioning data stored in complete condition to simplify the positioning equations. As the clock bias persists for a short period, this proposed method could work out accurate positioning results by only two visible satellites, without the need of computing the clock bias. Also, the Kalman filtering algorithm is used to smooth the trajectories, and improve the positioning results. During the incomplete period, only two satellites for 30 seconds and three satellites for 60 seconds, the preliminary experiment result shows that, the presented method could provide almost the same positioning results as in complete condition. 展开更多
关键词 Bei Dou navigation satellite system incomplete condition dual-satellite positioning algorithm kalman filtering
暂未订购 下载PDF
Primal-Dual Interior-Point Algorithms with Dynamic Step-Size Based on Kernel Functions for Linear Programming 认领 引用 被引量：3
20
作者 钱忠根 白延琴 《Journal of Shanghai University(English Edition)》 2005年第5期391-396,共6页
In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functio... In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functions and non-serf-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynaraic step size are more efficient than those with fixed step size. 展开更多
关键词 linear programming （LP） interior-point algorithm small-update method large-update method.
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 158 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈