Avancerad sökning
Visar resultat 11 - 15 av 17 avhandlingar som matchar ovanstående sökkriterier.
11. Fixed Point Iterations for Finite Sum Monotone Inclusions
Sammanfattning : This thesis studies two families of methods for finding zeros of finite sums of monotone operators, the first being variance-reduced stochastic gradient (VRSG) methods. This is a large family of algorithms that use random sampling to improve the convergence rate compared to more traditional approaches. LÄS MER
12. Distributed Stochastic Programming with Applications to Large-Scale Hydropower Operations
Sammanfattning : Stochastic programming is a subfield of mathematical programming concerned with optimization problems subjected to uncertainty. Many engineering problems with random elements can be accurately modeled as a stochastic program. In particular, decision problems associated with hydropower operations motivate the application of stochastic programming. LÄS MER
13. Distributed Optimization with Nonconvexities and Limited Communication
Sammanfattning : In economical and sustainable operation of cyber-physical systems, a number of entities need to often cooperate over a communication network to solve optimization problems. A challenging aspect in the design of robust distributed solution algorithms to these optimization problems is that as technology advances and the networks grow larger, the communication bandwidth used to coordinate the solution is limited. LÄS MER
14. Experimental Evaluation of a Microwave Tomography System for Breast Cancer Detection
Sammanfattning : Microwave tomography is a potential candidate for future breast-cancer screening or diagnosis. Contrary to x-rays, microwaves are non-ionizing and therefore not a health risk by their own. The examination procedure would also be more comfortable for the patient compared to conventional mammography since no compression of the breast is needed. LÄS MER
15. Origin-destination matrix estimation from traffic counts
Sammanfattning : For most kind of analyses in the field of traffic modeling, there is a need for origin-destination (OD) matrices, which specify the travel demands between the origin and destination nodes in the network. The process of obtaining OD-matrices is long, complicated and expensive. LÄS MER