Distributed Extra-Gradient Methods for Constrained Optimization over Multiplex Networks

This paper develops a distributed extra-gradient method for constrained resource allocation over multiplex networks. The proposed formulation represents resource-balance and multiplex coordination constraints through a unified monotone residual operator, leading to a projected predictor-corrector algorithm that uses local computations and multiplex-neighbor communication, together with aggregation-and-broadcast when resource constraints couple non-neighboring agents. A convergence analysis establishes convergence of the projected extra-gradient iteration under monotonicity, Lipschitz continuity, feasibility, exact residual evaluation, and a sufficient step-size condition. A local linear rate requires additional error-bound regularity and is not claimed from the standing assumptions alone. The formulation is further extended to strongly connected weight-balanced directed multiplex networks by exploiting the skew-symmetric structure of the associated coupling operator. Numerical experiments are conducted on a three-layer multienergy resource-allocation benchmark with seven nodes per layer. The proposed method converges for unweighted undirected, weighted undirected, and weight-balanced directed multiplex topologies. A normalized step-size study illustrates the effect of the algorithmic step size on convergence speed, while a network-size study characterizes the computational behavior as the multiplex dimension increases. The latter reveals an increase in the residual Lipschitz constant and a corresponding deterioration in convergence for larger instances, identifying conditioning of the residual operator as an important limitation of the present first-order formulation. The results demonstrate the applicability of the proposed extra-gradient framework to constrained distributed optimization over heterogeneous multiplex networks and provide a basis for extensions involving adaptive preconditioning, acceleration, unbalanced directed networks, and uncertain or time-varying multienergy systems.

Authors

Institutions

Publication Details

Journal
Eng—Advances in Engineering
Published
2026-11-02
DOI
https://doi.org/10.3390/eng7110599
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Extra-Gradient Methods for Constrained Optimization over Multiplex Networks

Eduardo Mojica‐Nava
Eng—Advances in Engineering
Distributed Control Multi-Agent Systems
article

Distributed Extra-Gradient Methods for Constrained Optimization over Multiplex Networks

Eduardo Mojica‐Nava
article en

Abstract

This paper develops a distributed extra-gradient method for constrained resource allocation over multiplex networks. The proposed formulation represents resource-balance and multiplex coordination constraints through a unified monotone residual operator, leading to a projected predictor-corrector algorithm that uses local computations and multiplex-neighbor communication, together with aggregation-and-broadcast when resource constraints couple non-neighboring agents. A convergence analysis establishes convergence of the projected extra-gradient iteration under monotonicity, Lipschitz continuity, feasibility, exact residual evaluation, and a sufficient step-size condition. A local linear rate requires additional error-bound regularity and is not claimed from the standing assumptions alone. The formulation is further extended to strongly connected weight-balanced directed multiplex networks by exploiting the skew-symmetric structure of the associated coupling operator. Numerical experiments are conducted on a three-layer multienergy resource-allocation benchmark with seven nodes per layer. The proposed method converges for unweighted undirected, weighted undirected, and weight-balanced directed multiplex topologies. A normalized step-size study illustrates the effect of the algorithmic step size on convergence speed, while a network-size study characterizes the computational behavior as the multiplex dimension increases. The latter reveals an increase in the residual Lipschitz constant and a corresponding deterioration in convergence for larger instances, identifying conditioning of the residual operator as an important limitation of the present first-order formulation. The results demonstrate the applicability of the proposed extra-gradient framework to constrained distributed optimization over heterogeneous multiplex networks and provide a basis for extensions involving adaptive preconditioning, acceleration, unbalanced directed networks, and uncertain or time-varying multienergy systems.

Eng—Advances in EngineeringVol. 7(11)
Universidad Nacional de Colombia (CO)
Openalex Percentile: Top 15%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Distributed Extra-Gradient Methods for Constrained Optimization over Multiplex Networks — Eduardo Mojica‐Nava · Eng—Advances in Engineering (2026) | TGRS Research Map | TGRS