A proximal algorithm with backtracked extrapolation for a class of structured fractional programming

2022 ◽  
Vol 56 ◽  
pp. 98-122
Author(s):  
Qia Li ◽  
Lixin Shen ◽  
Na Zhang ◽  
Junpeng Zhou
Filomat ◽  
2017 ◽  
Vol 31 (9) ◽  
pp. 2557-2574 ◽  
Author(s):  
Tadeusz Antczak

Semi-infinite minimax fractional programming problems with both inequality and equality constraints are considered. The sets of parametric saddle point conditions are established for a new class of nonconvex differentiable semi-infinite minimax fractional programming problems under(?,?)-invexity assumptions. With the reference to the said concept of generalized convexity, we extend some results of saddle point criteria for a larger class of nonconvex semi-infinite minimax fractional programming problems in comparison to those ones previously established in the literature.


2020 ◽  
Vol 2 (1) ◽  
pp. 92
Author(s):  
Rahim Rahmani ◽  
Ramin Firouzi ◽  
Sachiko Lim ◽  
Mahbub Alam

The major challenges of operating data-intensive of Distributed Ledger Technology (DLT) are (1) to reach consensus on the main chain as a set of validators cast public votes to decide on which blocks to finalize and (2) scalability on how to increase the number of chains which will be running in parallel. In this paper, we introduce a new proximal algorithm that scales DLT in a large-scale Internet of Things (IoT) devices network. We discuss how the algorithm benefits the integrating DLT in IoT by using edge computing technology, taking the scalability and heterogeneous capability of IoT devices into consideration. IoT devices are clustered dynamically into groups based on proximity context information. A cluster head is used to bridge the IoT devices with the DLT network where a smart contract is deployed. In this way, the security of the IoT is improved and the scalability and latency are solved. We elaborate on our mechanism and discuss issues that should be considered and implemented when using the proposed algorithm, we even show how it behaves with varying parameters like latency or when clustering.


1986 ◽  
Vol 50 (2) ◽  
pp. 279-288 ◽  
Author(s):  
R. N. Kaul ◽  
S. Kaur ◽  
V. Lyall

Sign in / Sign up

Export Citation Format

Share Document