arXiv subjects

Xu Du

Publications and source records attributed to Xu Du.

At least 19 recordsLinked to original sources

arXiv2026

Decentralized Linearized Consensus ADMM with Efficient Quantized Communication

Distributed optimization offers significant advantages over centralized methods in terms of scalability and robustness when solving large-scale problems. In this paper, we propose a novel decentralized optimization algorithm that integrates Inexact Consensus ADMM (IC-ADMM) with a finite-time decentralized quantized communication algorithm. The proposed method enjoys three main benefits: (i) it operates on directed communication graphs, (ii) it requires only quantized local information instead of exact values, and (iii) it does not rely on solving the local subproblems exactly. Under the assumption that each node's local objective is strongly convex and L-smooth, the algorithm is guaranteed to achieve global linear convergence to a neighborhood of the optimal solution. Extensive numerical experiments demonstrate its advantages over existing methods in terms of convergence speed and communication efficiency.

math.OC↗

arXiv2026

CADMM-Prox: A Bi-level Consensus ADMM for Non-smooth Non-convex Distributed Consensus Optimization

Non-smooth and non-convex optimization problems are pervasive in machine learning, control, and signal processing, due to the need for sparse solutions and the inherently non-convex nature of many objective functions. In this paper, we study non-smooth and non-convex distributed optimization problems. We propose a novel bi-level Consensus Alternating Direction Method of Multipliers (ADMM) algorithm, termed CADMM-Prox. The proposed algorithm integrates classical Consensus ADMM with a proximal mechanism by introducing a sufficiently large proximal term associated with an outer-level variable. Under the mild assumption that the local objective functions are semi-convex, CADMM-Prox is guaranteed to converge globally to a neighborhood of a Clarke stationary point. Numerical experiments on a phase retrieval problem demonstrate that our proposed method exhibits more stable convergence behavior compared with baseline algorithm.

math.OC↗

arXiv2026

A Global Convergence Analysis of Consensus ALADIN for Convex Optimization

Distributed optimization problems are pervasive in machine learning and optimal control. In this paper, we study smooth strongly convex distributed consensus optimization problems. We present a distributed optimization algorithm for consensus problems based on the Consensus Augmented Lagrangian Alternating Direction Inexact Newton (C-ALADIN) framework. Our algorithm uses an auxiliary variable to decide when to update second-order information, enabling curvature exploitation without sacrificing global convergence. This contrasts with existing C-ALADIN methods, which require constant Hessian approximations and thus lose numerical advantages. Under smooth strong convexity, the algorithm converges globally, and the auxiliary variable converges sublinearly. Numerical experiments on logistic regression show that our algorithm outperforms baseline methods that use either fixed or updated Hessian information.

eess.SY↗

arXiv2026

Distributed and Decentralized Optimization Algorithms via Consensus ALADIN

Distributed optimization has found widespread applications in smart grids, optimal control, and machine learning. This paper studies distributed consensus optimization. We extend the Augmented Lagrangian-based Alternating Direction Inexact Newton (ALADIN) framework to propose Consensus ALADIN (C-ALADIN) with a central coordinator, which directly handles consensus constraints. Our C-ALADIN algorithm admits both a first-order variant and a second-order variant that employs a Hessian approximation, avoiding direct transmission of second-order information while preserving fast local convergence. We then develop a decentralized version of C-ALADIN that operates over directed graphs with quantized communication, using a finite-time coordination protocol. For both versions, we establish global convergence guarantees for convex problems and local convergence guarantees for non-convex problems. For the decentralized case, the iterates converge to a neighborhood of the optimum determined by the quantization level. Numerical results demonstrate that our methods retain fast convergence while substantially reducing communication and computational costs compared to existing decentralized approaches.

math.OC↗

arXiv2026

Nesterov Accelerated Distributed Optimization with Efficient Quantized Communication

In modern large-scale networked systems, rapidly solving optimization problems while utilizing communication resources efficiently is critical for addressing complex tasks. In this paper, we consider an unconstrained distributed optimization problem in which information exchange among nodes is governed by a directed communication graph. In our setup we focus on two key challenges. The first is the zigzag phenomenon caused by the objective functions of individual nodes having significantly different curvature along different directions. The second is that the communication channels among nodes are subject to limited bandwidth, which motivates the use of compressed (quantized) messages. To address both challenges simultaneously, we propose QANM, a distributed optimization algorithm that combines Nesterov-accelerated gradient descent with a distributed finite-time quantized consensus protocol, enabling accelerated convergence. Under strong convexity and smoothness assumptions, we show that our proposed algorithm converges linearly to a neighborhood of the optimal solution. Finally, we validate our algorithm on a distributed sensor fusion application for multi-dimensional target parameter estimation, where simulations across two distinct scenarios confirm the convergence guarantees and demonstrate clear acceleration benefits over non-momentum baselines.

eess.SY↗

arXiv2026

Affine-coupled Distributed Optimization via Distributed Proximal Jacobian ADMM with Quantized Communication

This paper investigates distributed resource allocation optimization over directed graphs with limited communication bandwidth. We develop a novel distributed algorithm that integrates the centralized Proximal Jacobian Alternating Direction Method of Multipliers (PJ-ADMM) with a finite-level quantized consensus scheme, enabling nodes to cooperatively solve the optimization in a distributed fashion. Under the assumption of convex objective functions, we establish that the proposed algorithm achieves sublinear convergence to a neighborhood of the optimal solution, with the convergence accuracy explicitly bounded by the quantization level. Numerical experiments validate that the algorithm achieves competitive performance compared to existing approaches while exhibiting communication efficiency.

math.OC↗

arXiv2026

Mix-CALADIN: A Distributed Algorithm for Consensus Mixed-Integer Optimization

This paper addresses distributed consensus optimization problems with mixed-integer variables, with a specific focus on Boolean variables. We introduce a novel distributed algorithm that extends the Consensus Augmented Lagrangian Alternating Direction Inexact Newton (CALADIN) framework by incorporating specialized techniques for handling Boolean variables without relying on local mixed-integer solvers. Under the mild assumption of Lipschitz continuity of the objective functions, we establish rigorous convergence guarantees for both convex and nonconvex mixed-integer programming problems. Numerical experiments demonstrate that the proposed algorithm achieves competitive performance compared to existing approaches while providing rigorous convergence guarantees.

math.OC↗

arXiv2026

Lightweight Real-Time ALADIN for Distributed Optimization

This paper presents a real-time computational framework for multi-node distributed optimization by extending the Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) algorithm. Our approach integrates adjoint sequential quadratic programming (SQP) techniques to enable efficient approximation of Jacobian information within the ALADIN embedded quadratic program, thereby reducing communication overhead. Furthermore, to decrease computational complexity, we design an event-triggered update strategy that avoids updating Hessian and Jacobian matrices at every iteration. The proposed method achieves local convergence and enhanced communication efficiency, making it well suited for time-critical applications. Numerical experiments demonstrate that our approach achieves competitive performance while exhibiting superior computational efficiency in real-time scenarios, validating its practical applicability for time-sensitive distributed optimization challenges.

math.OC↗

arXiv2026

Triple Antidot Molecules

We report the realization and modeling of a triple-antidot molecule hosting three interacting quantum Hall quasiparticles, with tunnel coupling between antidots tunable via the magnetic field. The measured tunneling conductance spectrum reveals the molecular energy levels arising from the inter-antidot coupling and Coulomb interaction. A tunneling model is established which shows good qualitative agreement with experimental observations. This work lays the foundation for the realization of complex systems of antidots for quantum Hall quasiparticles with non-trivial quantum statistics.

cond-mat.mes-hall↗

arXiv2025

Localizing Individual Exciton on a Quantum Hall Antidot

Quantum Hall systems host quasiparticles demonstrating correlated electron physics and non-trivial quantum statistics. Excitonic phases, archetypical for interaction effect, have attracted significant interest in recent years in double-layer quantum Hall systems where spatially separated electrons and holes form bosonic condensate through Coulomb interaction. Here, employing the approach of quantum Hall antidot with two spatially separated edge channels, we demonstrate a new type of quantum Hall quasiparticle exciton which represents a quantum-coherent bound state of an electron and a hole situated on their corresponding edges coupled through intralayer tunneling and Coulomb interaction. Quantum-coherent dynamics of the exciton is reflected in the observed evolution of the position and magnitude of the antidot conductance peaks around the electron-hole resonance. The quantum Hall antidot setup allows localization and electrical tuning of individual quantum Hall excitons. Quantum superposition of vacuum- and electron-hole pairing states is observed through the gate-dependent tunneling conductance of the antidot. Modeling the electron-hole pair as a coupled two-level system, semi-quantitative understanding of experimental observations is achieved. This work opens avenues for creating quantum systems of multiple quantum Hall quasiparticles.

cond-mat.mes-hall↗

arXiv2025

Decentralized Optimization via RC-ALADIN with Efficient Quantized Communication

In this paper, we investigate the problem of decentralized consensus optimization over directed graphs with limited communication bandwidth. We introduce a novel decentralized optimization algorithm that combines the Reduced Consensus Augmented Lagrangian Alternating Direction Inexact Newton (RC-ALADIN) method with a finite time quantized coordination protocol, enabling quantized information exchange among nodes. Assuming the nodes' local objective functions are $\mu$-strongly convex and simply smooth, we establish global convergence at a linear rate to a neighborhood of the optimal solution, with the neighborhood size determined by the quantization level. Additionally, we show that the same convergence result also holds for the case where the local objective functions are convex and $L$-smooth. Numerical experiments demonstrate that our proposed algorithm compares favorably against algorithms in the current literature while exhibiting communication efficient operation.

math.OC↗

arXiv2025

Bolometric Superconducting Optical Nanoscopy (BOSON)

Superconducting transition-edge sensors are renowned for their extraordinary photon sensitivity and energy resolution, finding applications spanning quantum information, astronomy, and nanophotonics. Here, we report the development of BOlometric Superconducting Optical Nanoscopy (BOSON), a novel platform that integrates bolometric detection at the superconducting transition edges with near-field optical techniques. BOSON enables the mapping of photoinduced changes in superconductivity with unprecedented spatial resolution and photon sensitivity. By incorporating BOSON with low-dimensional materials, we achieved polariton imaging at nanowatt excitation levels--at least four orders of magnitude lower than the power typically required in prior near-field nanoscopy experiments. Our findings highlight the potential for BOSON to advance scanning probe based optical platforms to enable the detection of photons, polaritons, and Cooper pair dynamics at the nanoscale. This paves the way for quantum sensing applications using single-polariton detection and can offer deeper insights into quasiparticle dynamics.

quant-ph↗

arXiv2025

Photocurrent Nanoscopy of Quantum Hall Bulk

Understanding nanoscale electronic and thermal transport of two-dimensional (2D) electron systems in the quantum Hall regime, particularly in the bulk insulating state, poses considerable challenges. One of the primary difficulties arises from the presence of chiral edge channels, whose transport behavior obscures the investigation of the insulating bulk. Using near-field (NF) optical and photocurrent (PC) nanoscopy, we probe real-space variations of the optical and thermal dynamics of graphene in the quantum Hall regime without relying on complex sample or electrode geometries. Near the charge neutrality point (CNP), we detect strong optical and photothermal signals from resonant inter-Landau level (LL) magnetoexciton excitations between the 0th and +-1st LLs, which gradually weaken with increasing doping due to Pauli blocking. Interestingly, at higher doping levels and full integer LL fillings, photothermal signals reappear across the entire sample over a ~10-micrometer scale, indicating unexpectedly long cooling lengths and nonlocal photothermal heating through the insulating bulk. This observation suggests thermal conductivity persists for the localized states even as electronic transport is suppressed - a clear violation of the Wiedemann-Franz (WF) law. Our experiments provide novel insights into nanoscale thermal and electronic transport in incompressible 2D gases, highlighting the roles of magnetoexcitons and chiral edge states in the thermo-optoelectric dynamics of Dirac quantum Hall state.

cond-mat.mes-hall↗

arXiv2025

A Time Splitting Based Optimization Method for Nonlinear MHE

Moving Horizon Estimation~(MHE) is essentially an optimization-based approach designed to estimate the states of dynamic systems within a moving time horizon. Traditional MHE solutions become computationally prohibitive due to the \textit{curse of dimensionality} arising from increasing problem complexity and growing length of time horizon. To address this issue, we propose novel computationally efficient algorithms for solving nonlinear MHE problems. Specifically, we first introduce a distributed reformulation utilizing a time-splitting technique. Leveraging this reformulation, we develop the Efficient Gauss-Newton Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) to achieve computational efficiency. Additionally, to accommodate limited computational capabilities inherent in some sub-problem solvers, we propose the Efficient Sensitivity Assisted ALADIN, which enables sub-problems to be solved inexactly without hindering computational efficiency. Furthermore, recognizing scenarios where sub-problem solvers possess no computational power, we propose a Distributed Sequential Quadratic Programming (SQP) that relies solely on first- and second-order information of local objective functions. We demonstrate the performance and advantages of our proposed methods through numerical experiments on differential drive robots case, a practical nonlinear MHE problem. Our results demonstrate that the three proposed algorithms achieve computational efficiency while preserving high accuracy, thereby satisfying the real-time requirements of MHE.

eess.SY↗

arXiv2025

ALADIN-$\beta$: A Distributed Optimization Algorithm for Solving MPCC Problems

Mathematical Programs with Complementarity Constraints (MPCC) are critical in various real-world applications but notoriously challenging due to non-smoothness and degeneracy from complementarity constraints. The $\ell_1$-Exact Penalty-Barrier enhanced \texttt{IPOPT} improves performance and robustness by introducing additional inequality constraints and decision variables. However, this comes at the cost of increased computational complexity due to the higher dimensionality and additional constraints introduced in the centralized formulation. To mitigate this, we propose a distributed structure-splitting reformulation that decomposes these inequality constraints and auxiliary variables into independent sub-problems. Furthermore, we introduce Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN)-$\beta$, a novel approach that integrates the $\ell_1$-Exact Penalty-Barrier method with ALADIN to efficiently solve the distributed reformulation. Numerical experiments demonstrate that even without a globalization strategy, the proposed distributed approach achieves fast convergence while maintaining high precision.

eess.SY↗

arXiv2025

Convergence Theory of Flexible ALADIN for Distributed Optimization

The Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method is a cutting-edge distributed optimization algorithm known for its superior numerical performance. It relies on each agent transmitting information to a central coordinator for data exchange. However, in practical network optimization and federated learning, unreliable information transmission often leads to packet loss, posing challenges for the convergence analysis of ALADIN. To address this issue, this paper proposes Flexible ALADIN, a random polling variant of ALADIN, and presents a rigorous convergence analysis, including global convergence for convex problems and local convergence for non-convex problems.

eess.SY↗

arXiv2025

Distributed Consensus Optimization with Consensus ALADIN

TThe paper proposes the Consensus Augmented Lagrange Alternating Direction Inexact Newton (Consensus ALADIN) algorithm, a novel approach for solving distributed consensus optimization problems (DC). Consensus ALADIN allows each agent to independently solve its own nonlinear programming problem while coordinating with other agents by solving a consensus quadratic programming (QP) problem. Building on this, we propose Broyden-Fletcher-Goldfarb-Shanno (BFGS) Consensus ALADIN, a communication-and-computation-efficient Consensus ALADIN.BFGS Consensus ALADIN improves communication efficiency through BFGS approximation techniques and enhances computational efficiency by deriving a closed form for the consensus QP problem. Additionally, by replacing the BFGS approximation with a scaled identity matrix, we develop Reduced Consensus ALADIN, a more computationally efficient variant. We establish the convergence theory for Consensus ALADIN and demonstrate its effectiveness through application to a non-convex sensor allocation problem.

eess.SY↗

arXiv2024

Cram\'er-Rao Bound Based Waveform Optimization for MIMO Radar: An Efficient Linear-Proximal Method

This paper focuses on radar waveform optimization for minimizing the Cram\'er-Rao bound (CRB) in a multiple-input multiple-output (MIMO) radar system. In contrast to conventional approaches relying on semi-definite programming (SDP) and optimization toolboxes like CVX, we introduce a pioneering and efficient waveform optimization approach in this paper. Our proposed algorithm first applies sequential linear approximation to transform the original CRB-based problem with the transmit power constraint into a sequence of convex subproblems. By introducing a proximal term and further leveraging the Karush-Kuhn-Tucker (KKT) conditions, we derive the optimal closed-form solution for each subproblem. The convergence of the proposed algorithm is then proved rigorously. Numerical results demonstrate that the proposed approach significantly reduces computational complexity -- at least two orders of magnitude lower than the baseline algorithms while maintaining the same radar sensing accuracy.

eess.SP↗