Semidefinite Programming Relaxation Method for Sensor Network Localization
Meifang Zhang
Abstract
Meifang Zhang
Abstract
A semidefinite programming method(SDP)has been proposed to solve the sensor network localization.However,due to themax-rankproperty of theSDP relaxation,we use SDP relaxation solution as the initial localization,further improving it by gradientbased local search method.Result of the simulation shows Semidefinite Programming Ralaxation methodis fine feasibility and effciency.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A semidefinite programming method(SDP)has been proposed to solve the sensor network localization.However,due to themax-rankproperty of theSDP relaxation,we use SDP relaxation solution as the initial localization,further improving it by gradientbased local search method.Result of the simulation shows Semidefinite Programming Ralaxation methodis fine feasibility and effciency.
Key concepts: Semidefinite programming, Semidefinite embedding, Relaxation (psychology), Mathematical optimization, Computer science, Linear programming, Wireless sensor network, Mathematics