First-Order Constrained Optimization: Non-smooth Dynamical System Viewpoint

?

First-Order Constrained Optimization: Non-smooth Dynamical System Viewpoint

IFAC-PapersOnLine. 2022. Vol. 55. No. 16. P. 236–241.

Schechtman S., Tiapkin D., Moulines E., Jordan M., Muehlebach M.

In a recent paper, Muehlebach and Jordan (2021a) proposed a novel algorithm for constrained optimization that uses original ideals from nonsmooth dynamical systems. In this work, we extend Muehlebach and Jordan (2021a) in several important directions: (i) we provide existence and convergence results for continuous-time trajectories under general conditions, and (ii) we provide a convergence guarantee for a perturbed version of the discrete-time version of the algorithm (covering stochastic gradient updates), for nonconvex and nonsmooth objective functions. Our analysis framework rationalizes the continuous-time and discrete-time cases, which not only provides an important intuition but could also enable convergence proofs for accelerated or Newton-like versions of our algorithm.

Research target: Computer Science

Effects of Elevation Changes and Multilevel Structures on Vehicular Signal Propagation

Stepanyants V., Andrey V. Fizulin, Chibirov A. et al., FUTURE TRANSPORTATION 2026 Vol. 6 No. 5 Article 225

Reliable Vehicle-to-Everything (V2X) evaluation requires propagation models that represent terrain and multilevel infrastructure. Most integrated vehicular simulators still rely on planar models, but the magnitude of the resulting bias is unclear. This study quantitatively compares flattened two-dimensional (2D) and terrain-aware three-dimensional (3D) variants of three scenarios using identical Sionna RT settings. The pipeline combines OpenStreetMap ...

Added: October 8, 2026

Автоматизированное построение математических теорий

Люксембург А. А., УРСС, 2005.

Изучается возможность автоматизированного построения математических теорий. Рассматривается дедуктивная система, основанная на языке логики предикатов первого порядка, объектами системы являются математические выражения или формулы, которые описывают математические объекты или их свойства. В дедуктивной системе выводятся математические определения и теоремы. Для доказательства теорем используются методы автоматического доказательства. Разработан алгоритм, выводящий часть формул системы. Для решения задачи используется аппарат математической ...

Added: October 7, 2026

Automated Ranking of Soybean Plots from Close-Range RGB Video via Depth Filtering and Point-Based Counting

Groshev Maksim, Rybakov Petr, Teterin N. et al., Sensors 2026 Article 6171

Manual assessment of soybean yield components, such as pod number, is laborious, time-consuming, and subjective. Existing computer-vision approaches based on object detection or instance segmentation perform poorly on close-range RGB imagery of soybean canopies due to severe occlusions, ambiguous plant boundaries, and the high cost of bounding-box annotation. To address these challenges, we propose a ...

Added: October 7, 2026

Новые информационные технологии в исследовании сложных структур. Материалы шестнадцатой международной конференции 21–25 Сентября 2026 г.

Томск: Издательство Томского государственного университета, 2026.

Материалы сборника Шестнадцатой Международной конференции «Новые информационные технологии в исследовании сложных структур» (Москва, 21–25 сентября 2026 г.) ориентированы на широкий круг специалистов, работающих на стыке теории информации, системного анализа и прикладных предметных областей. В издание вошли результаты исследований, посвящённые моделированию дискретных и стохастических структур управления и связи, разработке высокопроизводительных вычислительных и телекоммуникационных систем, а также вопросам цифровой трансформации образования, архитектурно-градостроительного проектирования, экологического ...

Added: October 6, 2026

Оптимизация энергопотребления предприятия с использованием методов многокритериальной оптимизации

Серебренников Д. А., Belov A. V., Информационные технологии и вычислительные системы 2026 № 3 С. 157–169

В условиях роста стоимости энергоресурсов и необходимости повышения энергоэффективности производственных процессов особую актуальность приобретает задача оптимизации энергопотребления промышленных предприятий. В данной работе рассматривается подход к управлению энергозатратами машиностроительного предприятия на основе методов многокритериальной оптимизации. Постановка задачи включает несколько целевых функций: минимизацию энергопотребления, минимизацию стоимости электроэнергии с учётом тарифных ограничений и максимизацию производственной эффективности. Для решения ...

Added: October 5, 2026

On Practical Aspects of Constructing Quasi-Cyclic Subfield Subcodes of Dual Elliptic Codes and Their Application in McEliece-type Cryptosystems

Kuninets A., IEEE Transactions on Information Theory 2026 P. 1–1

In this work we study the applicability of Quasi-Cyclic Subfield Subcodes of Dual Elliptic (QC-SSDE) codes for integration into code-based cryptographic schemes. Detailed algorithms are provided for constructing parity-check matrices as well as block-circulant parity-check matrices for this family of codes, accompanied by empirical results that enable the construction of QC-SSDE codes with predetermined dimensions. ...

Added: October 3, 2026

Инкрементальный метод обновления многомерного куба по неупорядоченному потоку событий журналов информационных систем

Zykov S. V., Уфимцев Г. А., Моделирование, оптимизация и информационные технологии 2026 Т. 14 № 8 С. 1–13

Информационные системы формируют большие объёмы событийных журналов, которые используются для анализа работы приложений и сервисов. При этом события могут поступать в аналитический контур позже момента их фактического возникновения и не в исходном порядке. Такая рассинхронизация приводит к ошибкам при построении агрегированных временных показателей, а регулярный полный пересчёт многомерного аналитического куба требует значительных вычислительных затрат. Целью ...

Added: October 2, 2026

Polarization of opinions in the group: a modeling algorithm considering the dynamics of social bonds

Chebotarev V., Andreyuk D., Elizarova Anastasiya et al., Procedia Computer Science 2022 Vol. 213 No. C P. 596–601

The dynamics of opinion in a group are of interest for a number of practical purposes. In particular, consensus helps and polarization of opinions hinders cohesive teamwork. Existing approaches for modeling opinion dynamics mostly do not take into account the dynamism of social relations in a group. This paper proposes an algorithm and a program ...

Added: October 2, 2026

Enhancing Boundary Stability in Decision Trees and Random Forests: A Weighted Sample Duplication Approach

Konstantinov A., Elizarova Anastasiya P., Utkin L., Computing, Telecommunications and Control 2026 Vol. 19 No. 1 P. 16–25

Decision trees and their ensemble extensions, such as random forests, are widely used as classification models due to their simplicity and interpretability. However, in many real-world tasks where class labels overlap in the feature space, standard decision trees rely on hard splits that create fragile decision boundaries. In these regions, small perturbations in the input ...

Added: October 2, 2026

Bayesian Adaptive Sparse Copula

Prokhorov A., Burda M., Journal of Computational and Graphical Statistics 2026 P. 1–13

Bayesian nonparametric density estimation procedures are typically based on single-scale priors, such as Dirichlet process mixtures. Alternative multiscale density priors built on decision trees have many well-known advantages, including the ability to characterize abrupt local changes and to provide an estimate with a desired level of resolution. Despite their theoretical appeal, multiscale methods have typically ...

Added: October 2, 2026

Pericyte-derived cancer-associated fibroblasts correlate with poor survival and are enriched after chemoradiotherapy in glioblastoma

Aly Ismailov, Poptsova M., Plos One 2026 Vol. 21 No. 9 Article e0355902

Added: October 2, 2026

Консервативные энтропийно и энергетически корректные разностные методы для одномерных квазигазодинамических систем уравнений

Zlotnik A., Математические заметки 2026 Т. 120 № 6 С. 1005–1009

Численным методам решения систем газодинамических уравнений посвящена обширная литература. Ранее было разработано и успешно апробировано специальное семейство симметричных по пространству консервативных разностных методов, основанных на предварительной кинетической, точнее, квазигазодинамической (КГД), регуляризации этих уравнений. Актуальной задачей является построение численных методов, которые обладают не только свойством консервативности по массе, импульсу и полной энергии, но и удовлетворяют условиям энтропийной ...

Added: October 1, 2026

Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2026)

International Joint Conferences on Artificial Intelligence, 2026.

Added: October 1, 2026

Ensemble-based Prototype-Augmented Multimodal Fusion for Ambivalence/Hesitancy Recognition

Ryumina E., Aksenov A., Сысоев Д. С. et al., IEEE Computer Society, 2026.

Ambivalence/hesitancy recognition in unconstrained videos is a challenging problem due to the subtle, multimodal, and context-dependent nature of this behavioral state. In this paper, a multimodal approach for video-level ambivalence/hesitancy recognition is presented for the 10th ABAW Competition. The proposed approach integrates four complementary modalities: scene, face, audio, and text. Scene dynamics are captured with ...

Added: September 30, 2026

Decoding Algorithms for Binary U-UV Codes: A Unified Survey of Performance and Complexity

Ivanov F., Kotov F., IEEE Access 2026 Vol. 14 P. 104662–104679

U-UV codes, based on the Plotkin (U, U + V) construction, provide a unified framework that includes polar and Reed–Muller codes and enables flexible design through the choice of component codes. While modern capacity-approaching codes achieve excellent performance at large block lengths, their efficiency at short and moderate lengths remains limited, especially under low-latency constraints. ...

Added: September 30, 2026

The EG-TD3 Machine Learning Architecture: Evolutionary-Guided Twin Delayed Deep Deterministic Policy Gradient

Djambong Tenkeu H., Institute for System Programming of the RAS, 2026.

Added: September 29, 2026

Нижние множества и свойства замкнутости классов функций подсчета

Ivanashev Y., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2026 Т. 529 С. 93–101

Язык L является нижним для релятивизируемого сложностного класса C, если CL=C. Для классов #P, GapP и SpanP известны точные нижние классы языков: Low(#P) = UP ∩ coUP, Low(GapP) = SPP и Low(SpanP) = NP ∩ coNP. В этой статье мы доказываем, что Low(TotP) = P, и приводим характеризации нижних классов функций для #P, GapP, TotP ...

Added: September 28, 2026

Role of dislocations in the mobility of pinned helium bubbles: Molecular dynamics simulations in aluminum

Piliugin L., Antropov A., Lobashev E. et al., Journal of Nuclear Materials 2026 Vol. 632 Article 156876

The effects of dislocations on the mobility of gas nanobubbles pinned to them are considered as novel unex- plored mechanisms of accelerated fission gas release and investigated using classical molecular dynamics of helium bubbles in FCC aluminum. Non-equilibrium methods are developed to calculate the mobility of a pinned bubble both along and across the dislocation ...

Added: September 28, 2026

Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact

Kornilov N., Gasnikov A., Dvurechensky P. et al., Computational Management Science 2023 Article 37

We present two easy-to-implement gradient-free/zeroth-order methods to optimize a stochastic non-smooth function accessible only via a black-box. The methods are built upon efficient first-order methods in the heavy-tailed case, i.e., when the gradi- ent noise has infinite variance but bounded (1 + 𝜅)-th moment for some 𝜅 ∈ (0, 1]. The first algorithm is based ...

Added: February 7, 2025

Vaidya’s method for convex stochastic optimization problems in small dimension

Gladin E., Gasnikov A., Ermakova E., Mathematical notes 2022 Vol. 112 No. 1 P. 183–190

The paper deals with a general problem of convex stochastic optimization in a space of small dimension (for example, 100 variables). It is known that for deterministic problems of convex optimization in small dimensions, the methods of centers of gravity type (for example, Vaidya’s method) provide the best convergence. For stochastic optimization problems, the question ...

Added: November 29, 2024

Метод эллипсоидов для задач выпуклой стохастической оптимизации малой размерности

Gladin E., Зайнуллина К. Э., Компьютерные исследования и моделирование 2021 Т. 13 № 6 С. 1137–1147

The article considers minimization of the expectation of convex function. Problems of this type often arise in machine learning and a variety of other applications. In practice, stochastic gradient descent (SGD) and similar procedures are usually used to solve such problems. We propose to use the ellipsoid method with mini-batching, which converges linearly and can ...

Added: November 29, 2024

Gradient-free Federated Learning Methods with l1 and l2-randomization for Non-smooth Convex Stochastic Optimization Problems

Alashqar B., Gasnikov A., Dvinskikh D. et al., Computational Mathematics and Mathematical Physics 2023 Vol. 63 P. 1600–1653

This paper studies non-smooth problems of convex stochastic optimization. Using the smoothing technique based on the replacement of the function value at the considered point by the averaged function value over a ball (in l1-norm or l2-norm) of a small radius centered at this point, and then the original problem is reduced to a smooth problem (whose ...

Added: March 27, 2024

Accelerated zeroth-order method for non-smooth stochastic convex optimization problem with infinite variance

Kornilov N., Shamir O., Lobanov A. et al., , in: Advances in Neural Information Processing Systems 36 (NeurIPS 2023).: Curran Associates, Inc., 2023. P. 64083–64102.

Added: March 26, 2024

Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold

Schechtman S., Tiapkin D., Muehlebach M. et al., , in: Proceedings of Machine Learning Research: Volume 195: The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, IndiaVol. 195: The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, India.: PMLR, 2023. P. 1228–1258.

We consider the problem of minimizing a non-convex function over a smooth manifold M. We propose a novel algorithm, the Orthogonal Directions Constrained Gradient Method (ODCGM), which only requires computing a projection onto a vector space. ODCGM is infeasible but the iterates are constantly pulled towards the manifold, ensuring the convergence of ODCGM towards M. ...

Added: December 1, 2023