http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
COMBINING TRUST REGION AND LINESEARCH ALGORITHM FOR EQUALITY CONSTRAINED OPTIMIZATION
Yu, Zhensheng,Wang, Changyu,Yu, Jiguo 한국전산응용수학회 2004 Journal of applied mathematics & informatics Vol.14 No.1
In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.
SOME RESULTS ON FRACTIONAL n-FACTOR-CRITICAL GRAPHS
Yu, Jiguo,Bian, Qiuju,Liu, Guizhen,Wang, Na 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.25 No.1
A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.
Combining trust region and linesearch algorithm for equality constrained optimization
Zhensheng Yu,Changyu Wang,Jiguo Yu 한국전산응용수학회 2004 Journal of applied mathematics & informatics Vol.14 No.-
In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.
SINR based Maximum Link Scheduling with Uniform Power in Wireless Sensor Networks
( Baogui Huang ),( Jiguo Yu ),( Dongxiao Yu ),( Chunmei Ma ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.11
In wireless sensor networks, link scheduling is a fundamental problem related to throughput capacity and delay. For a given set of communication requests L={l<sub>1</sub>,l<sub>2</sub>…,l<sub>n</sub>}, the MLS (maximum link scheduling) problem aims to find the largest possible subset S of L such that the links in S can be scheduled simultaneously. Most of the existing results did not consider bidirectional transmission setting, which is more realistic in wireless sensor networks. In this paper, under physical interference model SINR (signal-to-noise-plus-interference-ratio) and bidirectional transmission model, we propose a constant factor approximation algorithm MLSA (Maximum Link Scheduling Algorithm) for MLS. It is proved that in the same topology setting the capacity under unidirectional transmission model is lager than that under bidirectional transmission model. However, compared with some work under unidirectional transmission model, the capacity of MLSA is improved about 28% to 45%.
CIRCULAR LIST COLORINGS OF SOME GRAPHS
WANG, GUANGHUI,LIU, GUIZHEN,YU, JIGUO 한국전산응용수학회 2006 Journal of applied mathematics & informatics Vol.20 No.1
The circular list coloring is a circular version of list colorings of graphs. Let $\chi_{c,l}$ denote the circular choosability(or the circular list chromatic number). In this paper, the circular choosability of outer planar graphs and odd wheel is discussed.