Results 41 to 50 of about 2,178 (210)

A note on generalised information criteria for structured sparse models

International Statistical Review, EarlyView.
Summary We propose a generalised information criteria ( gic) that accounts for sparsity pattern in the model. We obtain both asymptotic and nonasymptotic results for model selection. Moreover, we show that the gic is useful for selecting the regularisation parameter in regularised m$$ m $$ estimation in high‐dimensional scenarios.
Eduardo Fonseca Mendes, Gabriel Jardim Pereira Pinto   +1 more
wiley   +1 more source

A Consensus Approach to Distributed Convex Optimization in Multi-Agent Systems [PDF]

, 2013
In this thesis we address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where a network of agents, each endowed with local private convex cost and subject to communication constraints ...
Filippo Zanella, Zanella, Filippo
core  

Connectivity, Transmission Power, and Lifetime Optimization in Asymmetric Networks: A Distributed Approach

IEEE Access, 2018
One of the fundamental challenges of deploying sensor networks in applications, such as environmental monitoring and surveillance, is power management in the presence of various constraints.
Milad Esmaeilpour, Amir Aghdam, Stephane Blouin   +2 more
doaj   +1 more source

Monotone Clusters With Ordinal Interpretation

Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 4, August 2026.
ABSTRACT There has been a growing demand in various sectors, such as healthcare, finance, and social sciences, for clustering methods that not only find quality clusters in data but also provide inherent order among the clusters for better decision‐making and risk assessment. Traditional clustering methods, though effective at grouping data, often fall
Hee Cheol Chung, Seongbin An, Hyunwoo Cha, Jeongyoun Ahn   +3 more
wiley   +1 more source

Delayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization

Algorithms
In this work, we consider the problem of minimizing a quasi-convex function over a nonempty closed convex constrained set. In order to approximate a solution of the considered problem, we propose delayed star subgradient methods.
Ontima Pankoon, Nimit Nimana
doaj   +1 more source

Distributed Optimization of Finite Condition Number for Laplacian Matrix in Multi‐Agent Systems

International Journal of Robust and Nonlinear Control, Volume 36, Issue 9, Page 5030-5043, June 2026.
ABSTRACT This paper addresses the distributed optimization of the finite condition number of the Laplacian matrix in multi‐agent systems. The finite condition number, defined as the ratio of the largest to the second smallest eigenvalue of the Laplacian matrix, plays an important role in determining the convergence rate and performance of consensus ...
Yicheng Xu, Faryar Jabbari
wiley   +1 more source

Faster subgradient methods for functions with Hölderian growth [PDF]

Mathematical Programming, 2019
The purpose of this manuscript is to derive new convergence results for several subgradient methods applied to minimizing nonsmooth convex functions with Hölderian growth. The growth condition is satisfied in many applications and includes functions with quadratic growth and weakly sharp minima as special cases.
Patrick R. Johnstone, Pierre Moulin
openaire   +3 more sources

Distributed optimization algorithm for multi-agent optimization problems using consensus control

Journal of Advanced Mechanical Design, Systems, and Manufacturing
The distributed optimization algorithms using consensus control are proposed for solving multi-agent optimization problems. The multi-agent optimization problem has discrete and continuous decision variables to minimize the sum of local cost functions ...
Tatsushi NISHI, Naoto DEBUCHI, Ziang LIU
doaj   +1 more source

Distributed Event-Triggered Subgradient Method for Convex Optimization With General Step-Size

IEEE Access, 2020
In this paper, the consensus and optimization of a multiagent system in a distributed optimization problem with bounded constraint is discussed under the general step-size, which is square nonsummable.
Ran Li, Xiaowu Mu
doaj   +1 more source

An inertial parallel CQ subgradient extragradient method for variational inequalities application to signal-image recovery

Results in Nonlinear Analysis, 2021
In this paper, we introduce an inertial parallel CQ subgradient extragradient method for finding a common solutions of variational inequality problems.
Ponkamon Kitisak, Watcharaporn Cholamjiak, Damrongsak Yambangwai
doaj   +1 more source