Sökning: "local graph limit"

Hittade 2 avhandlingar innehållade orden local graph limit.

1. 1. On random satisfiability and optimization problems

   Författare :Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

   Sammanfattning : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. LÄS MER

3. 2. Accelerating Convergence of Large-scale Optimization Algorithms

   Författare :Euhanna Ghadimi; Mikael Johansson; Angelia Nedich; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Convex optimization; Large-scale systems; First-order methods; Convergence analysis; ADMM; Optimization algorithms; Electrical Engineering; Elektro- och systemteknik; Matematik; Mathematics;

   Sammanfattning : Several recent engineering applications in multi-agent systems, communication networks, and machine learning deal with decision problems that can be formulated as optimization problems. For many of these problems, new constraints limit the usefulness of traditional optimization algorithms. LÄS MER