Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems [PDF]
Journal of Optimization Theory and Applications, 2020 The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a competitive worst case iteration complexity rate, and a guaranteed rate of local convergence for both zero and ...
El Houcine Bergou +2 more
openaire +4 more sources
On convergence and complexity analysis of an accelerated forward–backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification [PDF]
Journal of Inequalities and Applications, 2021 AbstractIn this work, we introduce a new accelerated algorithm using a linesearch technique for solving convex minimization problems in the form of a summation of two lower semicontinuous convex functions. A weak convergence of the proposed algorithm is given without assuming the Lipschitz continuity on the gradient of the objective function. Moreover,
Panitarn Sarnmeta +3 more
openaire +3 more sources
EEG-based real-time diagnostic system with developed dynamic 2TEMD and dynamic ApEn algorithms
Frontiers in Physiology, 2023 In real-time electroencephalography (EEG) analysis, the problem of observing dynamic changes and the problem of binary classification is a promising direction. EEG energy and complexity are important evaluation metrics in brain death determination in the
Ran Zhang +5 more
doaj +1 more source
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II [PDF]
Yugoslav Journal of Operations Research, 2014 This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we
Eremeev Anton V., Kovalenko Julia V.
doaj +1 more source
A deterministic algorithm for the discrete logarithm problem in a semigroup
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O(NlogN)O\left(\sqrt{N}\log N) and a space complexity of O(N)O\left ...
Tinani Simran, Rosenthal Joachim
doaj +1 more source
Volumetric Barrier Cutting Plane Algorithms for Stochastic Linear Semi-Infinite Optimization
IEEE Access, 2020 In this paper, we study the two-stage stochastic linear semi-infinite programming with recourse to handle uncertainty in data defining (deterministic) linear semi-infinite programming.
Baha Alzalg, Asma Gafour, Lewa Alzaleq
doaj +1 more source
Low-Complexity Multi-User Detection Based on Gradient Information for Uplink Grant-Free NOMA
IEEE Access, 2020 Massive machine type communication (mMTC) serves an irreplaceable role in the development process of the Internet of Things (IoT). Because of its characteristics of massive connection and sporadic transmission, compressed sensing (CS) has been applied in
Fang Jiang +4 more
doaj +1 more source
On Characterizing the Data Access Complexity of Programs [PDF]
, 2014 Technology trends will cause data movement to account for the majority of energy expenditure and execution time on emerging computers. Therefore, computational complexity will no longer be a sufficient metric for comparing algorithms, and a fundamental ...
Bilardi G. +5 more
core +5 more sources
On the Average-case Complexity of Parameterized Clique [PDF]
, 2014 The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W[1]-complete problems.
Bollobás +22 more
core +2 more sources
Worst-Case Optimal Algorithms for Parallel Query Processing [PDF]
, 2016 In this paper, we study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with $p$ servers.
Beame, Paul +2 more
core +2 more sources