Sökning: "Convex optimization"
Visar resultat 11 - 15 av 195 avhandlingar innehållade orden Convex optimization.
11. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization
Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER
12. Spectral Estimation by Geometric, Topological and Optimization Methods
Sammanfattning : .... LÄS MER
13. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods
Sammanfattning : Non-smooth convex optimization problems occur in all fields of engineering. A common approach to solving this class of problems is proximal algorithms, or splitting methods. These first-order optimization algorithms are often simple, well suited to solve large-scale problems and have a low computational cost per iteration. LÄS MER
14. Coordinated MultiPoint Transmission with Incomplete Information
Sammanfattning : The demand for higher data rates and efficient use of various resources has been an unquenchable thirst across different generations of cellular systems, and it continues to be so. Aggressive reuse of frequency resources in cellular systems gives rise to intercell interference which severely affects the data rate of users at the cell-edge. LÄS MER
15. Efficient and Flexible First-Order Optimization Algorithms
Sammanfattning : Optimization problems occur in many areas in science and engineering. When the optimization problem at hand is of large-scale, the computational cost of the optimization algorithm is a main concern. LÄS MER