Search for dissertations about: "convex optimization"

Showing result 11 - 15 of 196 swedish dissertations containing the words convex optimization.

  2. 11. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

    Author : Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

    Abstract : 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. READ MORE

  4. 12. Spectral Estimation by Geometric, Topological and Optimization Methods

    Author : Per Enqvist; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Spectral Estimation; ARMA models; Covariance analysis; Cepstral analysis; Markov parameters; Global analysis; Convex Optimization; Continuation methods; Entropy maximization; Optimization; systems theory; Optimeringslära; systemteori;

    Abstract : .... READ MORE

  5. 13. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods

    Author : Mattias Fält; Institutionen för reglerteknik; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; First-order methods; Convex Optimization; Nonsmooth Optimization; Large-scale Optimization; Iterative Methods; Douglas-Rachford splitting; Line Search;

    Abstract : 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. READ MORE

  6. 14. Coordinated MultiPoint Transmission with Incomplete Information

    Author : Tilak Rajesh Lakshmana; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; precoding; coordinated multipoint; joint transmission; backhauling; particle swarm optimization; decentralized; stochastic optimization; convex optimization; efficient backhauling; centralized;

    Abstract : 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. READ MORE

  7. 15. Efficient and Flexible First-Order Optimization Algorithms

    Author : Hamed Sadeghi; Institutionen för reglerteknik; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Monotone Inclusion; Convex Optimization; First-Order Methods; Fixed-Point Iterations; Forward–Backward Splitting; Primal–Dual Algorithm;

    Abstract : 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. READ MORE