Sökning: "convex"

Visar resultat 11 - 15 av 174 uppsatser innehållade ordet convex.

1. 11. Focal Spot Optimization Using Spatial Light Modulation and a Phase Retrieval Algorithm

   Master-uppsats, Lunds universitet/Atomfysik; Lunds universitet/Fysiska institutionen

   Författare :Robert Petersen; [2023]
   Nyckelord :Spatial Light Modulation; Phase Retrieval Algorithm; Focal Spot Optimization; Adaptive Optics; Wavefront Sensing; Lasers; Physics and Astronomy; Technology and Engineering;

   Sammanfattning : Aberrations to the wavefront of a laser beam reduce the quality of the focal spot and are generally undesired. This project is aimed at determining the aberrations of laser beams by using a phase retrieval algorithm and to show that it is possible to correct the aberrations with a spatial light modulator to optimize the focal spot. LÄS MER

3. 12. Extremal Mechanisms for Pointwise Maximal Leakage

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Leonhard Grosse; [2023]
   Nyckelord :Privacy; mechanism design; information leakage; convex optimization; information-theoretic utility; Integritet; Mekanismdesign; informationsläckage; konvex optimering; informationsteoretisk användbarhet.;

   Sammanfattning : In order to implement privacy preservation for individuals, systems need to utilize privacy mechanisms that privatize sensitive data by randomization. The goal of privacy mechanism design is to find optimal tradeoffs between maximizing the utility of the privatized data while providing a strict sense of privacy defined by a chosen privacy measure. LÄS MER

4. 13. Minimum Cost Distributed Computing using Sparse Matrix Factorization

   Master-uppsats, KTH/Optimeringslära och systemteori

   Författare :Seif Hussein; [2023]
   Nyckelord :Applied mathematics; optimization; convex optimization; matrix factorization; sparse matrix factorization; distributed computing; linearly separable distributed computing; ADMM; alternating direction method of multipliers; tillämpad matematik; optimering; konvex optimering; matrisfaktorisering; gles matrisfaktorisering; distribuerade beräkningar; admm; alternating direction method of multipliers;

   Sammanfattning : Distributed computing is an approach where computationally heavy problems are broken down into more manageable sub-tasks, which can then be distributed across a number of different computers or servers, allowing for increased efficiency through parallelization. This thesis explores an established distributed computing setting, in which the computationally heavy task involves a number of users requesting a linearly separable function to be computed across several servers. LÄS MER

5. 14. Optimization over nonnegative matrix polynomials

   Master-uppsats, Linköpings universitet/Institutionen för systemteknik

   Författare :Daniel Cederberg; [2023]
   Nyckelord :Proximal methods; nonnegative polynomials; Bregman proximal operator; Itakura-Saito distance; spectral estimation; functional connectivity analysis.;

   Sammanfattning : This thesis is concerned with convex optimization problems over matrix polynomials that are constrained to be positive semidefinite on the unit circle. Problems of this form appear in signal processing and can often be solved as semidefinite programs (SDPs). LÄS MER

7. 15. Real-Time Soft Body Physics Engine for Enhanced ConvexPolygon Dynamics

   Uppsats för yrkesexamina på grundnivå, Örebro universitet/Institutionen för naturvetenskap och teknik

   Författare :Martin Vickgren; [2023]
   Nyckelord :Soft-body Physics; Convex Polygons; Real-time Simulation; Collision Resolution; Physics Engine;

   Sammanfattning : This thesis covers the development process of implementation, and evaluation of a softbody physics engine for convex polygon objects. The main feature is implementation of adynamic polygon collider that represents a polygons shape correctly, while still being ableto collide with other objects in the simulation. LÄS MER