Approximate Subgradient Methods for Lagrangian Relaxations on Networks
, 2007 Nonlinear network flow problems with linear/nonlinear side constraints can be solved by means of Lagrangian relaxations. The dual problem is the maximization of a dual function whose value is estimated by minimizing approximately a Lagrangian function on
Eugenio Mijangos
core
Entropy-Based Age-Aware Scheduling Strategy for UAV-Assisted IoT Data Transmission. [PDF]
Entropy (Basel)Jing L, Wang H, Qin Z, Zhu P.
europepmc +1 more source
A comparison of two subgradient methods for solving allocation problem
, 2004 We consider and compare two subgradient type methods ("simple' and r-algorithm) for finding lower bounds in branch-and-bound method while solving allocation type problem with new kinds of discounts in the objective function.
Стецюк, П.И. +3 more
core
Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction. [PDF]
IEEE Trans Inf TheoryFridovich-Keil S +4 more
europepmc +1 more source
Adaptive lateral constraint-driven POCS interpolation method. [PDF]
Sci RepQin Z, Pan S, Chen J, Wang W, Chen Y.
europepmc +1 more source
Wireless sensor network design with reliable and long network lifetime. [PDF]
Sci RepÇelik E, Keskin ME.
europepmc +1 more source
An improved Lagrangian relaxation algorithm based SDN framework for industrial internet hybrid service flow scheduling. [PDF]
Sci Rep, 2022 Song Y, Luo W, Xu P, Wei J, Qi X.
europepmc +1 more source
Enhancing dance education through convolutional neural networks and blended learning. [PDF]
PeerJ Comput SciZhang Z, Wang W.
europepmc +1 more source
Universal feature selection for simultaneous interpretability of multitask datasets. [PDF]
J CheminformRaymond M +3 more
europepmc +1 more source
An Optimization-Based Orchestrator for Resource Access and Operation Management in Sliced 5G Core Networks. [PDF]
Sensors (Basel), 2021 Hsiao CH +6 more
europepmc +1 more source