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 3 of 3 for “"primal recovery"”.

  1. Recovery of primal solution in dual subgradient schemes

    In this thesis, we study primal solutions for general optimization problems. In particular, we employ the subgradient method to solve the Lagrangian dual of a convex constrained problem, and use a primal-averaging scheme to obtain near-optimal and near-feasible primal solutions. We numerically …

    mit Repository record for Recovery of primal solution in dual subgradient schemes (opens in a new tab)

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

    … when applied in concert with suitable primal recovery strategies, have the potential for providing quick bounds as well as enabling useful branching mechanisms. However, the objective function of the Lagrangian dual is nondifferentiable, and hence, we cannot apply popular gradient or …

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

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

    … With this motivation, we present a practical primal-dual subgradient algorithm that incorporates a dual ascent, a primal recovery, and a penalty function approach to recover a near optimal and feasible pair of primal and dual solutions. The proposed primal-dual approach is comprised of three …

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