Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 15 of 15 for “"Subgradient algorithm"”.

  1. An inexact deflected subgradient algorithm with applications to optimal control problems

    … infinite dimensions. Then we design a deflected subgradient algorithm using our primal-dual framework and solve optimal control problems using the framework and the algorithm.

    adelaide Repository record for An inexact deflected subgradient algorithm with applications to optimal control problems (opens in a new tab)

  2. A subgradient algorithm for nonlinear integer programming and its parallel implementation

    … is a general nonlinear function. The notion of subgradient for the objective function is introduced. A necessary and sufficient condition for the optimal solution is constructed. And a new algorithm, called the subgradient algorithm, is developed. The algorithm is an iterative procedure, …

    rice Repository record for A subgradient algorithm for nonlinear integer programming and its parallel implementation (opens in a new tab)

  3. A primal-dual conjugate subgradient algorithm for large- scale/specially structured linear programming problems

    … dissertation deals with a primal-dual conjugate subgradient-based algorithm for solving large-scale and/or specially structured linear programming problems. The proposed algorithm coordinates a Lagrangian dual function and a primal penalty function which satisfies a flexible set of specified …

    vt Repository record for A primal-dual conjugate subgradient algorithm for large- scale/specially structured linear programming problems (opens in a new tab)

  4. Special versus standard algorithms for large-scale harvest scheduling problems

    … with structure exploitation and the design of algorithms for solving large-scale harvest scheduling problems. We discover that the harvest scheduling problem involving area constraints possesses a network structure. In Model I-Form 1, the network constraints form a separable block diagonal …

    vt Repository record for Special versus standard algorithms for large-scale harvest scheduling problems (opens in a new tab)

  5. Efficient design of reconfigurable intelligent surface assisted multi-group multicast beamforming

    … (RIS). We propose low-complexity scalable algorithms for the joint design of the base station (BS) multicast beamformer and the RIS passive beamformer to minimize the transmit power subject to the quality-of-service (QoS) constraints and maximize the minimum quality-of-service among all …

    uoit Repository record for Efficient design of reconfigurable intelligent surface assisted multi-group multicast beamforming (opens in a new tab)

  6. Coordinated multicast beamforming for multi-cell massive MIMO systems

    … approximation (SCA). To further design a fast algorithm applicable to massive MIMO systems, we apply the alternating direction method of multipliers (ADMM) technique and propose an ADMM-based first-order algorithm to solve the quality of service (QoS) problem, which decompose the QoS problem …

    uoit Repository record for Coordinated multicast beamforming for multi-cell massive MIMO systems (opens in a new tab)

  7. Inexact subgradient methods.

    … evaluation of the objective function and its subgradients can be computationally burdensome. For example, in a stochastic program, the objective function is typically defined through a multi-dimensional integration. Solution procedures for stochastic programs are usually based on functional …

    arizona-thes Repository record for Inexact subgradient methods. (opens in a new tab)

  8. Optimal random access protocols for wireless networks

    In this thesis, we present several random access algorithms for medium access control in wireless networks. Optimization theory, game theory, and dynamic programming are applied in the analysis and the design of these algorithms. First, we study the problem of multi-channel random access using the …

    ubc Repository record for Optimal random access protocols for wireless networks (opens in a new tab) Download PDF for Optimal random access protocols for wireless networks (opens in a new tab)

  9. Admission control and radio resource allocation for multicasting over high altitude platforms

    … requirements. Lagrangian relaxation and the subgradient algorithm are used to obtain solution bounds for the primary system model problem formulation. These bounds were then used in the branch and bound algorithm for pruning of nodes. The numerical results illustrate the goodness of the …

    manitoba Repository record for Admission control and radio resource allocation for multicasting over high altitude platforms (opens in a new tab)

  10. Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems

    … problems, using linearization and branch-and-cut algorithms for the discrete case, and using polyhedral outer-approximation methods for the continuous case. These problems arise in various applications in production planning, location-allocation, game theory, economics, and many engineering and …

    vt Repository record for Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems (opens in a new tab)

  11. CONSENSUS, PREDICTION AND OPTIMIZATION IN DIRECTED NETWORKS

    This dissertation develops theory and algorithms for distributed consensus in multi-agent networks. The models considered are opinion dynamics models based on the well known DeGroot model. We study the following three related topics: consensus of networks with leaders, consensus prediction, and …

    maryland Repository record for CONSENSUS, PREDICTION AND OPTIMIZATION IN DIRECTED NETWORKS (opens in a new tab)

  12. Comparison of Routing and Network Coding in Group Communications

    … Wu et al. introduced a greedy tree-packing algorithm based on Prim's algorithm as an alternate sub-optimal solution [2] . This algorithm is modified in this work for group communications problem with routing in undirected networks. The throughput benefit for network coding has been shown in …

    usf Repository record for Comparison of Routing and Network Coding in Group Communications (opens in a new tab)

  13. Distributed Online Optimization on time-varying networks

    … of discrete-time distributed online optimization algorithms, with a group of agents which communicate over a network. At each time, a private convex objective function is revealed to each agent. In the next time step, each agent updates its state using its own objective function and the …

    queens Repository record for Distributed Online Optimization on time-varying networks (opens in a new tab)

  14. Random projection methods for stochastic convex minimization

    … The problem has random features. Gradient or subgradient of objective function carries stochastic errors. Number of constraint sets can be extensive or infinitely many. Constraint sets might not be known apriori yet revealed through random realizations or randomly chosen from a collection of …

    uiuc Repository record for Random projection methods for stochastic convex minimization (opens in a new tab)

  15. Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems

    … is to develop new ATSP formulations so that algorithms can be built by taking advantage of their relaxations (of integer variables, thereby, resulting in linear programs) to effectively solve large-size problems. In view of our objective, it is essential to have a formulation that is amenable …

    vt Repository record for Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems (opens in a new tab)