Augmented Lagrangian
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Modified augmented Lagrangian preconditioning for mixed-dimensional beam-solid coupling
Announce Type: new Abstract: This paper presents modified augmented Lagrangian block preconditioners for the mixed-dimensional coupling of three-dimensional solid bodies with embedded one-dimensional torsion-free Kirchhoff-Love beams using Lagrange multipliers for constraint enforcement. The finite element discretization of this mixed formulation leads to an indefinite saddle-point system. An augmented Lagrangian formulation is employed to regularize the linear system while maintaining exact...
Augmented Lagrangian Predictive Coding
arXiv:2605.31022v1 Announce Type: new Abstract: Predictive coding (PC) is a local-learning alternative to backpropagation (BP), training deep networks via local energy-minimization dynamics rather than a global backward pass. We introduce Augmented Lagrangian Predictive Coding (PC-ALM), which maintains PC's inference budget but aligns each weight update toward BP by accumulating per-layer constraint errors into a layer-local Lagrange multiplier. In linear PC networks, PC-ALM converges to an...
A piecewise constant levelset approach for semi-blind deconvolution: Application to barcode decoding
arXiv:2606.01156v1 Announce Type: new Abstract: We consider a semi-blind deconvolution problem arising in the decoding of blurred linear barcodes. Building on the Piecewise Constant Level Set (PCLS) framework introduced in [De\,Cezaro et al., Inv.\,Probl., 29 (2013), 015003], we propose and analyze a solution method based on augmented Lagrangians to obtain stable approximate solutions to the corresponding inverse problem with respect to noisy measurements. We establish the existence of...
Parallel multilevel methods for solving the Darcy--Forchheimer model based on a nearly semicoercive formulation
Announce Type: replace Abstract: High-velocity fluid flow through porous media is modeled by prescribing a nonlinear relationship between the flow rate and the pressure gradient, called the Darcy--Forchheimer equation. This paper is concerned with the analysis of parallel multilevel methods for solving the Darcy--Forchheimer model. We begin by reformulating the Darcy--Forchheimer model as a nearly semicoercive convex optimization problem via the augmented Lagrangian method.
Learning Temporal Causal Structure via Smooth Differentiable Optimization
arXiv:2606.03227v1 Announce Type: new Abstract: Causal discovery with instantaneous effects in multivariate time series is challenging, as the instantaneous structure must be acyclic. Prior methods enforce this by either separating instantaneous and lagged estimation into multi-stage pipelines or imposing algebraic acyclicity constraints via complex augmented Lagrangian optimization, both of which incur high computational cost.
Policy-Conditioned Counterfactual Credit for Verifiable Reinforcement Learning of Long-Horizon Language Agents
arXiv:2606.05263v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards improves reasoning and tool use, yet long-horizon language agents still learn unsupported evidence chains, belief drift, and shortcut actions that satisfy terminal checks. Existing process rewards are mostly correlational: they reward retrieval-, reflection-, or verification-like steps without estimating whether the step contributes to final verified success under a specified intervention. We...
Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment
arXiv:2502.15917v3 Announce Type: replace-cross Abstract: Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes binary integer programming, which is still NP-hard and computationally demanding for classical methods. Quantum Annealing (QA), known for efficiently solving Quadratic Unconstrained Binary...
Divergence-free unfitted finite element discretisations for the Darcy problem
arXiv:2603.26212v2 Announce Type: replace Abstract: We develop an unfitted compatible finite element discretisation for the Darcy problem based on $H(\mathrm{div})$-conforming flux spaces and discontinuous pressure spaces. The method is designed to preserve pointwise discrete mass conservation while remaining robust in the presence of arbitrarily small cut cells arising from unfitted meshes. Robustness is achieved by combining an $L^2$-stabilisation of the flux with an additional mixed-term...
SALAAD: Sparse And Low-Rank Adaptation via ADMM for Large Language Model Inference
arXiv:2602.00942v3 Announce Type: replace Abstract: Modern large language models are increasingly deployed under compute and memory constraints, making flexible control of model capacity a central challenge. While sparse and low-rank structures naturally trade off capacity and performance, existing approaches often rely on heuristic designs that ignore layer and matrix heterogeneity or require model-specific architectural modifications. We propose SALAAD, a plug-and-play framework applicable...
Enhanced Fluid Index Modulation for Integrated Data and Energy Transfer
arXiv:2606.04537v1 Announce Type: new Abstract: Integrated data and energy transfer (IDET) is a promising technique for supporting sustainable low-power wireless networks. To improve both communication reliability and energy transfer efficiency, this paper investigates a fluid index modulation (FIM) assisted IDET system, where the base station employs a two-dimensional fluid antenna system (FAS) and the receiver adopts a power-splitting architecture. In FIM, the information bits are...