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 5 of 5 for “"Nondifferentiable Optimization"”.

  1. Nondifferentiable optimization algorithms with application to solving Lagrangian dual problems

    In this research effort, we consider nondifferentiable optimization (NDO) problems that arise in several applications in science, engineering, and management, as well as in the context of other mathematical programming approaches such as Dantzig-Wolfe decomposition, Benders decomposition, …

    vt Repository record for Nondifferentiable optimization algorithms with application to solving Lagrangian dual problems (opens in a new tab)

  2. Nondifferentiable Optimization of Lagrangian Dual Formulations for Linear Programs with Recovery of Primal Solutions

    … the objective function of the Lagrangian dual is nondifferentiable, and hence, we cannot apply popular gradient or Hessian-based optimization techniques that are commonly used in differentiable optimization. Moreover, the subgradient methods that are popularly used are typically slow to converge …

    vt Repository record for Nondifferentiable Optimization of Lagrangian Dual Formulations for Linear Programs with Recovery of Primal Solutions (opens in a new tab)

  3. Limited Memory Space Dilation and Reduction Algorithms

    … one of the most effective procedures for solving nondifferentiable optimization problems. However, the method needs to store the space dilation matrix and update it at every iteration, resulting in a substantial computational burden for large-sized problems. To circumvent this difficulty, we first …

    vt Repository record for Limited Memory Space Dilation and Reduction Algorithms (opens in a new tab)

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

    … (see Sherali and Ulular [69]). We also use two nondifferentiable optimization (NDO) methods, namely, the variable target value method (VTVM) presented by Sherali et al. [66] and the trust region target value method (TRTV) presented by Lim and Sherali [46], on the Lagrangian dual formulation of …

    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)

  5. Centralized and distributed resource allocation with applications to signal processing in communications

    … the network. This dissertation provides a set of optimization techniques applicable to rigorously address and deeply analyze multiuser resource allocation problems in different areas, ranging from signal processing, to communications and networking. More specifically, this work focuses on the …

    uiuc Repository record for Centralized and distributed resource allocation with applications to signal processing in communications (opens in a new tab)