English
Related papers

Related papers: More on Arago'n Artacho -- Campoy's Algorithm Oper…

200 papers

We propose an extended forward-backward algorithm for approximating a zero of a maximal monotone operator which can be split as the extended sum of two maximal monotone operators. We establish the weak convergence in average of the sequence…

Optimization and Control · Mathematics 2013-06-25 Marc Lassonde , Ludovic Nagesseur

The purpose of this paper is to study the dynamical behavior of the sequence produced by a forward-backward algorithm involving two random maximal monotone operators and a sequence of decreasing step sizes. Defining a mean monotone operator…

Optimization and Control · Mathematics 2016-07-05 Pascal Bianchi , Walid Hachem

This paper presents a hierarchical low-rank decomposition algorithm assuming any matrix element can be computed in $O(1)$ time. The proposed algorithm computes rank-revealing decompositions of sub-matrices with a blocked adaptive cross…

Numerical Analysis · Mathematics 2019-09-06 Yang Liu , Wissam Sid-Lakhdar , Elizaveta Rebrova , Pieter Ghysels , Xiaoye Sherry Li

Average consensus (AC) strategies play a key role in every system that employs cooperation by means of distributed computations. To promote consensus, an $N$-agent network can repeatedly combine certain node estimates until their mean value…

Optimization and Control · Mathematics 2025-02-25 Ricardo Merched

This paper studies a class of monotone inclusion problems in a real Hilbert space involving the sum of three operators, where two are maximal monotone and the third is cocoercive. The Davis--Yin three-operator splitting method extends the…

Optimization and Control · Mathematics 2026-05-14 Maoran Wang , Zijun Xia , Xingju Cai

Non-orthogonal multiple access (NOMA) emerges as a superior technology for enhancing spectral efficiency compared to orthogonal multiple access. In NOMA networks, successive interference cancellation (SIC) plays a crucial role in decoding…

Networking and Internet Architecture · Computer Science 2024-07-23 Liang Huang , Bincheng Zhu , Runkai Nan , Kaikai Chi , Yuan Wu

The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA ansatz consists of an alternating application of the cost and…

Quantum Physics · Physics 2024-11-01 Anthony Wilkie , Igor Gaidai , James Ostrowski , Rebekah Herrman

Ant Colony Optimization (ACO) has been applied in supervised learning in order to induce classification rules as well as decision trees, named Ant-Miners. Although these are competitive classifiers, the stability of these classifiers is an…

Neural and Evolutionary Computing · Computer Science 2014-09-10 Gopinath Chennupati

In this paper, a new swarm intelligence algorithm based on orca behaviors is proposed for problem solving. The algorithm called artificial orca algorithm (AOA) consists of simulating the orca lifestyle and in particular the social…

Neural and Evolutionary Computing · Computer Science 2023-02-20 Habiba Drias , Lydia Sonia Bendimerad , Yassine Drias

In this paper, we propose an actor ensemble algorithm, named ACE, for continuous control with a deterministic policy in reinforcement learning. In ACE, we use actor ensemble (i.e., multiple actors) to search the global maxima of the critic.…

Machine Learning · Computer Science 2018-11-12 Shangtong Zhang , Hao Chen , Hengshuai Yao

This work presents a new three-operator splitting method to handle monotone inclusion and convex optimization problems. The proposed splitting serves as another natural extension of the Douglas-Rachford splitting technique to problems…

Optimization and Control · Mathematics 2025-10-03 Anshika Anshika , Jiaxing Li , Debdas Ghosh , Xiangxiong Zhang

The AP-LCA problem asks, given an $n$-node directed acyclic graph (DAG), to compute for every pair of vertices $u$ and $v$ in the DAG a lowest common ancestor (LCA) of $u$ and $v$ if one exists. In this paper we study several interesting…

Data Structures and Algorithms · Computer Science 2022-04-26 Surya Mathialagan , Virginia Vassilevska Williams , Yinzhan Xu

Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new application of CAs is implementing coordinators (i.e., compiling CAs…

Programming Languages · Computer Science 2019-03-14 Sung-Shik T. Q. Jongmans , Farhad Arbab

This paper presents a novel algorithm for the continuous control of dynamical systems that combines Trajectory Optimization (TO) and Reinforcement Learning (RL) in a single framework. The motivations behind this algorithm are the two main…

This paper proposes an effective method for estimating the parameters of double-cage induction motors by using Artificial Bee Colony (ABC) algorithm. For this purpose the unknown parameters in the electrical model of asynchronous machine…

Systems and Control · Computer Science 2014-02-19 Mohammad Jamadi , Farshad Merrikh-Bayat

In terms of the concepts of state and state transition, a new algorithm-State Transition Algorithm (STA) is proposed in order to probe into classical and intelligent optimization algorithms. On the basis of state and state transition, it…

Optimization and Control · Mathematics 2012-10-15 Xiaojun Zhou , Chunhua Yang , Weihua Gui

Collaborative Optimization (CO) is a multidisciplinary design optimization (MDO) framework that decomposes large-scale engineering problems into parallel, independently solvable subsystems coordinated by a system-level optimizer. Its…

Optimization and Control · Mathematics 2026-05-08 Mohamed Ali Belhafnaoui , Youssef Diouane

Swarm Intelligence algorithms have gained significant attention in recent years as a means of solving complex and non-deterministic problems. These algorithms are inspired by the collective behavior of natural creatures, and they simulate…

Computation and Language · Computer Science 2023-03-30 Amirhossein Mohammadi , Sara Hajiaghajani , Mohammad Bahrani

Algorithm configuration (AC) is concerned with the automated search of the most suitable parameter configuration of a parametrized algorithm. There is currently a wide variety of AC problem variants and methods proposed in the literature.…

Artificial Intelligence · Computer Science 2022-10-14 Elias Schede , Jasmin Brandt , Alexander Tornede , Marcel Wever , Viktor Bengs , Eyke Hüllermeier , Kevin Tierney

Proximal operators are now ubiquitous in non-smooth optimization. Since their introduction in the seminal work of Moreau, many papers have shown their effectiveness on a wide variety of problems, culminating in their use to construct…

Optimization and Control · Mathematics 2026-02-03 Guillaume Lauga , Samuel Vaiter