Standard

Bregman method and Yakubovich method for adaptation and learning. / Chen, O.; Fradkov, A.L.; Rodríguez-Cortés, H. (Editor).

In: IFAC-PapersOnLine, Vol. 59, No. 14, 2025, p. 262-265.

Research output: Contribution to journal › Conference article › peer-review

Harvard

Chen, O, Fradkov, AL & Rodríguez-Cortés, H (ed.) 2025, 'Bregman method and Yakubovich method for adaptation and learning', IFAC-PapersOnLine, vol. 59, no. 14, pp. 262-265. https://doi.org/10.1016/j.ifacol.2025.12.160

APA

Chen, O., Fradkov, A. L., & Rodríguez-Cortés, H. (Ed.) (2025). Bregman method and Yakubovich method for adaptation and learning. IFAC-PapersOnLine, 59(14), 262-265. https://doi.org/10.1016/j.ifacol.2025.12.160

Vancouver

Chen O, Fradkov AL, Rodríguez-Cortés H, (ed.). Bregman method and Yakubovich method for adaptation and learning. IFAC-PapersOnLine. 2025;59(14):262-265. https://doi.org/10.1016/j.ifacol.2025.12.160

Author

Chen, O. ; Fradkov, A.L. ; Rodríguez-Cortés, H. (Editor). / Bregman method and Yakubovich method for adaptation and learning. In: IFAC-PapersOnLine. 2025 ; Vol. 59, No. 14. pp. 262-265.

BibTeX

@article{f26ecd18db154543a59aa6cf4a76366d,
title = "Bregman method and Yakubovich method for adaptation and learning",
abstract = "The paper addresses the interrelations between two algorithms for finding a common point of convex sets, namely, Bregman's and Yakubovich's methods. Both algorithms were born in the 1960s yet never be compared. A kind of comparison is proposed and illustrated by examples. A new algorithm of finding an intersection of the convex sets (half-spaces) is proposed based on combination of the ideas of both approaches. {\textcopyright} 2025 The Authors.",
keywords = "Consensus algorithm, Geometry, Adaptation and learning, Bregman, Bregman methods, Convex set, Half spaces, Set theory",
author = "O. Chen and A.L. Fradkov and H. Rodr{\'i}guez-Cort{\'e}s",
note = "Export Date: 16 February 2026; Cited By: 0; Conference name: 15th IFAC Workshop on Adaptive and Learning Control Systems, ALCOS 2025; Conference location: Mexico City; Conference date: 2025-07-02 through 2025-07-04",
year = "2025",
doi = "10.1016/j.ifacol.2025.12.160",
language = "Английский",
volume = "59",
pages = "262--265",
journal = "IFAC-PapersOnLine",
issn = "2405-8971",
publisher = "Elsevier",
number = "14",

}

RIS

TY - JOUR

T1 - Bregman method and Yakubovich method for adaptation and learning

AU - Chen, O.

AU - Fradkov, A.L.

A2 - Rodríguez-Cortés, H.

N1 - Export Date: 16 February 2026; Cited By: 0; Conference name: 15th IFAC Workshop on Adaptive and Learning Control Systems, ALCOS 2025; Conference location: Mexico City; Conference date: 2025-07-02 through 2025-07-04

PY - 2025

Y1 - 2025

N2 - The paper addresses the interrelations between two algorithms for finding a common point of convex sets, namely, Bregman's and Yakubovich's methods. Both algorithms were born in the 1960s yet never be compared. A kind of comparison is proposed and illustrated by examples. A new algorithm of finding an intersection of the convex sets (half-spaces) is proposed based on combination of the ideas of both approaches. © 2025 The Authors.

AB - The paper addresses the interrelations between two algorithms for finding a common point of convex sets, namely, Bregman's and Yakubovich's methods. Both algorithms were born in the 1960s yet never be compared. A kind of comparison is proposed and illustrated by examples. A new algorithm of finding an intersection of the convex sets (half-spaces) is proposed based on combination of the ideas of both approaches. © 2025 The Authors.

KW - Consensus algorithm

KW - Geometry

KW - Adaptation and learning

KW - Bregman

KW - Bregman methods

KW - Convex set

KW - Half spaces

KW - Set theory

U2 - 10.1016/j.ifacol.2025.12.160

DO - 10.1016/j.ifacol.2025.12.160

M3 - статья в журнале по материалам конференции

VL - 59

SP - 262

EP - 265

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8971

IS - 14

ER -

ID: 148838307