• # LSMM

• Referenced in 2 articles [sw07010]
• Majorize-minimize linesearch for inversion methods involving barrier function optimization The authors consider the frequent ... unknown discretized object $x^0inbfR^N$ is represented by a linear model ... varepsilon$with$K$being a known ill-conditioned matrix and$varepsilon\$ an additive noise term ... efficient inversion methods are based on the minimization of a composite criterion...
• # DEXTRA

• Referenced in 4 articles [sw24935]
• reach agreement and collaboratively minimize the sum of their local objective functions over the network ... k/ √k) for general convex objective functions and O(ln k/k) when the objective functions ... strongly convex, where k is the number of iterations. We show that, with the appropriate ... step-size, DEXTRA converges at a linear rate O(τk) for 0 <; τ <; 1, given...
• # EIA-CNDP

• Referenced in 2 articles [sw38601]
• vertices whose removal maximizes or minimizes some objective function. In this paper, the focus ... objective function. In this regard, we introduce a new problem called K-Group-Division-Problem ... present a mixed integer linear programming model to solve it. We prove that under certain...