scholarly journals A parameterized Douglas–Rachford splitting algorithm for nonconvex optimization

2021 ◽  
Vol 410 ◽  
pp. 126425
Author(s):  
Fengmiao Bian ◽  
Xiaoqun Zhang
Keyword(s):  
Nonconvex Optimization ◽  
Splitting Algorithm

Constrained Distributed Nonconvex Optimization over Time-varying Directed Graphs

2020 ◽  
Author(s):  
Zhiyu He ◽  
Jianping He ◽  
Cailian Chen ◽  
Xinping Guan
Keyword(s):  
Nonconvex Optimization ◽  
Directed Graphs ◽  
Time Varying ◽  
Over Time

scholarly journals An ADMM-based SQP method for separably smooth nonconvex optimization

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Meixing Liu ◽  
Jinbao Jian
Keyword(s):  
Nonconvex Optimization ◽  
Sqp Method

On the Study of Cognitive Bidirectional Relaying with Asymmetric Traffic Demands

Frequenz ◽  
2015 ◽  
Vol 69 (5-6) ◽  
Author(s):  
Xiaodong Ji
Keyword(s):  
Ergodic Capacity ◽  
Base Station ◽  
Transmission Protocol ◽  
Splitting Algorithm ◽  
Performance Simulation ◽  
Information Theoretic ◽  
Primary Users ◽  
Operating Region ◽  
Bidirectional Relaying ◽  
Outage Probabilities

AbstractIn this paper, we consider a cognitive radio network scenario, where two primary users want to exchange information with each other and meanwhile, one secondary node wishes to send messages to a cognitive base station. To meet the target quality of service (QoS) of the primary users and raise the communication opportunity of the secondary nodes, a cognitive bidirectional relaying (BDR) scheme is examined. First, system outage probabilities of conventional direct transmission and BDR schemes are presented. Next, a new system parameter called operating region is defined and calculated, which indicates in which position a secondary node can be a cognitive relay to assist the primary users. Then, a cognitive BDR scheme is proposed, giving a transmission protocol along with a time-slot splitting algorithm between the primary and secondary transmissions. Information-theoretic metric of ergodic capacity is studied for the cognitive BDR scheme to evaluate its performance. Simulation results show that with the proposed scheme, the target QoS of the primary users can be guaranteed, while increasing the communication opportunity for the secondary nodes.

A multi-level splitting algorithm based on differential evolution

2018 ◽  
Vol 09 (02) ◽  
pp. 1850021
Author(s):  
Liping Wang ◽  
Wenhui Fan
Keyword(s):  
Differential Evolution ◽  
Rare Event ◽  
Sampling Strategy ◽  
Splitting Algorithm ◽  
Algorithm Efficiency ◽  
Event Simulation ◽  
Sample Paths ◽  
Level Splitting ◽  
Key Factor ◽  
Multi Level

Multi-level splitting algorithm is a famous rare event simulation (RES) method which reaches rare set through splitting samples during simulation. Since choosing sample paths is a key factor of the method, this paper embeds differential evolution in multi-level splitting mechanism to improve the sampling strategy and precision, so as to improve the algorithm efficiency. Examples of rare event probability estimation demonstrate that the new proposed algorithm performs well in convergence rate and precision for a set of benchmark cases.

Sign in / Sign up

Export Citation Format

Share Document