Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

44 results about "Subgradient method" patented technology

Subgradient methods are iterative methods for solving convex minimization problems. Originally developed by Naum Z. Shor and others in the 1960s and 1970s, subgradient methods are convergent when applied even to a non-differentiable objective function. When the objective function is differentiable, sub-gradient methods for unconstrained problems use the same search direction as the method of steepest descent.

D2D user resource distribution method based on multicarrier communication

The invention discloses a D2D user resource distribution method based on multicarrier communication, comprising steps of calculating signal to noise ratio on different subcarriers of each D2D user, distributing a subcarrier to each user according to the calculated signal to noise ratio value to enable the signal to noise ratio of each user to be greatest on the distributed subcarrier, performing distribution on the rest of subcarriers according to the signal to noise ratio of a weighing cellular user and the signal to noise ratio of the D2D user until all the subcarriers are distributed to the users, utilizing a subgradient method to perform iteration on lagrange factors and distributing emission power of the D2D user on each subcarrier in order to ensure the cellular user to meet the requirement of the lowest signal to noise ratio and maximization of D2D user system capacity. The D2D user resource distribution method performs subcarrier distribution on the D2D user on the premise that the cellular user lowest signal to noise ratio is guaranteed and establishes an optimized function which targets maximization of system capacity of the D2D user system and uses the cellular user signal to noise ratio and the D2D user emission power as the constraint condition so as to realize the subcarrier distribution and power distribution of the D2D user.
Owner:青岛联众芯云科技有限公司

Joint path selection and power distribution method for energy collection nodes in wireless sensor network

InactiveCN106131918ADetailed scene settingReasonable scene settingPower managementHigh level techniquesComputation complexityApproximate computing
The invention discloses a joint path selection and power distribution method for energy collection nodes in a wireless sensor network, and belongs to the field of cooperative communication technologies. The method comprises the steps of analyzing a system scene, describing problems; establishing a system mathematic model; and then finding the optimal solution by using an optimization method. The method aims at the special application scene and is derived from the actual application, and being different from the traditional independent sensor node or gateway resource distribution, the method comprehensively considers the joint power distribution and path selection of sensor nodes and gateways, and maximizes the handling capacity performance of the communication nodes by using the gateways as relay stations. According to the method of the invention, the solution of an optimization problem is processed by using convex optimization to convert a target function of the optimization problem without approximate calculation, so that computation complexity is greatly reduced while accuracy of the problem is not influenced, and delay generated by system overheads is reduced; a Lagrangian multiplier method is used in an optimizing process, and thus an optimizing speed is rapid; a subgradient method and an incremental step length are used in an iterative process, so that optimizing is more accurate.
Owner:唐山市汉维科技有限公司

Power control method based on SWIPT (Simultaneously Wireless Information and Power Transfer) in heterogeneous cellular network

ActiveCN108235419AMathematical Processing SimplifiedVerify validityPower managementHeterogeneous networkOptimization problem
The invention provides a power control method based on SWIPT (Simultaneously Wireless Information and Power Transfer) in a heterogeneous cellular network. The method comprises the steps of initializing system parameters, establishing a maximum energy efficiency optimization model according to a system scene, converting the model into a power control problem of a base station, and converting an original problem into a joint optimization problem between base station transmission power and a user side power distribution coefficient through variable substitution; under the condition that the userside power distribution coefficient rhok is fixed, carrying out solution through adoption of a subgradient method based on a Lagrange multiplier, and obtaining the optimum power control scheme P<k><*>of the base station according to a KKT condition; and obtaining the optimum energy efficiency value lambda<k><*> of a system through combination of a bisection method according to the obtained powercontrol scheme P<k><*>. According to the optimum power control method provided by the invention, the energy efficiency of the cellular system can be improved, the energy limited problem of a mobile device also can be effectively solved, and the method has certain guiding significance in a practice aspect.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Resource distribution method in energy acquisition small cellular network

InactiveCN106255220ADetailed scene settingReasonable scene settingTransmission monitoringHigh level techniquesComputation complexityApproximate computing
The invention discloses a resource distribution method in energy acquisition small cellular network, belonging to the technical field of wireless communication. The method comprises the steps of system scene analysis and problem resolution, system mathematics model establishment, and the obtainment of an optimal solution by an optimization method. The method is for a special application scene and is from practical application, the environmental protection scheme of renewable sources is fully considered, and combined with the cooperation forwarding function of a relay station, an energy acquisition relay station is used for the cooperation of data forwarding. For the solution of an optimization problem, the convex optimization processing is employed, the target function of an optimization problem is converted, without approximation calculating, while the problem precision is not influenced, the calculating complexity is reduced greatly, the time delay generated by system overhead is reduced, a Lagrange multiplier method is used in a searching optimization process, the searching optimization speed is fast, a subgradient method is employed in an algorithm iteration process, a progressive step length is employed, and the searching optimization is more accurate. The resource distribution method of the present invention has the advantages of reasonable algorithm design and easy realization.
Owner:辛建芳

Relay selection method of energy acquisition based multi-relay cooperative communication system

InactiveCN106304239ADetailed scene settingReasonable scene settingSite diversityHigh level techniquesComputation complexityCommunications system
The invention discloses a relay selection method of an energy acquisition based multi-relay cooperative communication system, and belongs to the technical field of cooperative communication. The relay selection method comprises steps of analyzing a system scene and summarizing problems; establishing a system mathematical model; and using an optimization method to solve an optimal solution. The relay selection method provided by the invention is practically applied in special application scenes, so compared with previous multi-relay selection methods, the relay selection method is characterized in that multi-relay cooperative communication based on energy acquisition is taken into consideration, and an expression of the throughput capacity is deduced, so the throughput capacity performance among communication nodes is maximized, solving of optimization problems is performed and the relay selection method has practical guidance meanings. Aiming at the solving of the optimization problem, convex optimization processing is adopted and a target function of an optimization problem is converted without approximate calculation, so precision of the problem is not affected, calculation complexity is greatly reduced, and time delays generated by expense of the system are reduced. During an optimization process, a lagrangian multiplier method is adopted, so optimization speed is fast. A subgradient method is adopted in an algorithm iteration process, and gradual step lengths are selected, so optimization is more accurate.
Owner:梁广俊

High resolution SAR image classification method based on co-sparse model

The invention discloses a high resolution SAR image classification method based on a co-sparse model and solves a technical problem of high classification time complexity caused by utilizing only an integrated sparse model to represent images during SAR image classification in the prior art. The method comprises steps that an initial pixel value matrix X is selected in to-be-classified SAR images; an analysis operator is selected to learn an initial sample; a projection subgradient method and a unified row specification tight frame method are combined to learn an analysis operator omega; an augmented lagrangian method is utilized to solve a co-sparse coefficient Z; a co-sparse coefficient vector of a pixel block corresponding to each pixel point and a pixel value vector of the pixel block are combined to acquire a characteristic vector; classification is carried out based on an SVM classifier to acquire a prediction label of each pixel point characteristic vector of the whole graph; the prediction label result is displayed in a gray image. The method is advantaged in that sparse expressions of the images can be rapidly acquired, classification timeliness and classification accuracy of the SAR images can be guaranteed, and the method is for high resolution SAR image classification.
Owner:XIDIAN UNIV

Unmanned aerial vehicle multi-dimensional resource management method with high energy efficiency

The invention discloses an unmanned aerial vehicle multi-dimensional resource management method with high energy efficiency and belongs to the technical field of wireless communication. The method specifically comprises the following steps: determining a user type; selecting an unmanned aerial vehicle or a ground base station to serve an edge or center user according to the user type; because of the high propulsion energy consumption of the unmanned aerial vehicle, establishing an optimized energy efficiency model combining multi-dimensional resource management of the height, speed, track radius and transmitting power of the unmanned aerial vehicle; decomposing a model objective function which is a non-convex function into four sub-problems , and separately solving the four sub-problems; for solving the power, using a Dinkelbach algorithm to convert a fractional optimization problem into a subtractive optimization problem, and then using a Lagrange method and a subgradient method for solving an optimization variable; solving other optimization variables by utilizing a relationship between a function derivative and an extreme value; repeating the above steps, determining whether theobjective function is converged or not, if so, stopping iteration, and if not, repeating the above steps. On the premise of ensuring the communication quality of the user, the system energy efficiency of the unmanned aerial vehicle network auxiliary edge user is improved.
Owner:XIDIAN UNIV

Optimal Power Allocation Method in Multi-channel Cognitive Wireless Networks Based on Convex Optimization

The optimal power allocation method in the multi-channel cognitive wireless network based on convex optimization disclosed by the present invention establishes a multi-channel cognitive wireless network model based on the frequency-common sharing mechanism, and establishes the total transmission power in peak form and each The optimization problem of maximizing the total communication rate of secondary users under the constraint of interference power of multiple channels, the convexity of the optimization problem is verified by using the convex optimization theory, and it is decomposed into sub-problems under specific channel conditions, and the Lagrange The dual method gives the KKT condition that the optimal solution satisfies, and gives the expression of the optimal solution with respect to the dual variable. Finally, the optimal power allocation scheme is solved by using the dichotomy method and the subgradient method. The present invention jointly considers multiple channels for spectrum sharing, adopts instantaneous peak interference power constraints to strictly protect primary users from interference, and uses multiple channels to enable secondary users to use greater transmission power to transmit, thereby further improving the comprehensiveness of spectrum resources utilization rate.
Owner:XI AN JIAOTONG UNIV

Resource allocation method for computing power network service function chain

The invention relates to a computing power network service function chain resource allocation method, which belongs to the field of edge computing and resource allocation, and comprises the following steps: S1, establishing a user uncertainty service function chain demand model; s2, based on the user uncertainty service function chain demand model, service node computing resources and transmission link network bandwidth resource allocation are jointly considered, and a computing power network service cost optimization problem model is established; s3, converting the optimization problem into a convex problem by using a variable relaxation method, solving by using a dual decomposition method and a subgradient method to obtain an optimal user node association and service link selection result, and obtaining a corresponding resource allocation scheme; s4, restoring the linear solution in the step S3 into a discrete solution by using a heuristic rounding algorithm; and S5, solving the residual traffic engineering problem based on the discrete solution, updating the continuous solution, and obtaining feasible solutions of all variables of the problem. According to the invention, the joint resource cost of the service node and the transmission link can be reduced.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Block chain-based transaction method, transaction system and computer storage medium

The invention relates to a block chain-based transaction method, a transaction system and a computer storage medium, which not only make full use of the significant characteristics of decentralization, non-tampering, anonymity and the like of a block chain technology to promote two transaction parties to form an overlay network and ensure the legal rights and interests and security performance of the two transaction parties, but also can improve the transaction efficiency based on a market benefit maximization principle. Compared with a traditional auction mechanism or a distributed optimization mechanism, the method has the advantages that a market settlement problem is expressed as an optimization problem, so that two parties of the transaction can flexibly and autonomously bargaining and determining the transaction number, complete transaction is completed on the basis of economic benefit maximization, the benefits of participants of the market settlement are maximized, and the market settlement efficiency is improved. And the transaction efficiency is ensured. Particularly, on the basis of a projection subgradient method, a total optimization problem is converted into a local sub-optimization problem, a convergence result is obtained through multiple iterations, legal rights and interests of two transaction parties can be fully guaranteed, calculation accuracy is high, efficiency is high, and the method is an efficient and high-quality optimization algorithm.
Owner:HUNAN TIAN HE GUO YUN TECH CO LTD

Optimal power distribution scheme in multi-channel cognitive wireless network based on convex optimization

The invention discloses an optimal power distribution scheme in a multi-channel cognitive wireless network based on convex optimization. A multi-channel cognitive radio network model based on a frequency spectrum sharing mechanism is established. An optimization problem of maximizing the total communication rate of the secondary user under the constraint of the total transmitting power in a peak form and the interference power of each channel is established; the convexity of the optimization problem is verified by using a convex optimization theory, the optimization problem is decomposed intosub-problems in a specific channel state, the KKT condition satisfied by the optimal solution is given by using a Lagrange dual method, the expression of the optimal solution about dual variables is given, and finally, the optimal power allocation scheme is solved by using a dichotomy and a sub-gradient method. According to the method, multiple channels are jointly considered for frequency spectrum sharing, instantaneous peak interference power constraints are adopted to strictly ensure that the primary user is not interfered, and meanwhile, multiple channels are utilized to enable the secondary user to transmit with higher transmitting power, so that the comprehensive utilization rate of frequency spectrum resources is further improved.
Owner:XI AN JIAOTONG UNIV

Optimization problem processing method and device for machine learning

The invention discloses an optimization problem processing method and device for machine learning. The method comprises the steps: determining an objective function and a constraint condition according to a to-be-solved problem, and continuing a next step in response to the fact that the objective function is a non-differentiable convex function; updating the current solution by using a projection subgradient method based on the number of iterations and the constraint condition, and substituting the current solution into the target function to obtain a current function value; in response to the fact that the current function value does not meet the convergence condition and the number of iterations does not exceed the preset upper limit, accumulating the number of iterations and re-executing the previous step; and determining a solution corresponding to an optimal value in the current function values as an optimal solution of the to-be-solved problem in response to the condition that the current function values meet the convergence condition or the number of iterations exceeds a preset upper limit. According to the method, the optimal solution problem of the non-differentiable function of machine learning can be solved, and the convergence speed is very high.
Owner:INSPUR SUZHOU INTELLIGENT TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products