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 20 of 36 for “"Subgradient method"”.

  1. PRIMAL-DUAL THEORY FOR THE SUBGRADIENT METHOD IN WEAKLY-CONVEX OPTIMIZATION

    Davis at al. prove the convergence rate of the subgradient method on weakly-convex functions to be O(k^−1/4). Still, the reliable stopping criterion remained unknown. This thesis establishes several computable stopping criteria from a new equivalent dual description for the classical subgradient …

    jhu Repository record for PRIMAL-DUAL THEORY FOR THE SUBGRADIENT METHOD IN WEAKLY-CONVEX OPTIMIZATION (opens in a new tab)

  2. SOME PRIMAL-DUAL THEORY FOR SUBGRADIENT METHODS FOR STRONGLY CONVEX OPTIMIZATION

    We consider (stochastic) subgradient methods for strongly convex but potentially nonsmooth non-Lipschitz optimization. We provide new equivalent dual descriptions (in the style of dual averaging) for the classic subgradient method, the proximal subgradient method, and the switching subgradient …

    jhu Repository record for SOME PRIMAL-DUAL THEORY FOR SUBGRADIENT METHODS FOR STRONGLY CONVEX OPTIMIZATION (opens in a new tab)

  3. 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)

  4. FIRST-ORDER METHODS FOR NONSMOOTH NONCONVEX FUNCTIONAL CONSTRAINED OPTIMIZATION WITH OR WITHOUT SLATER POINTS

    … In this paper, we show a simple first-order method finds a feasible, ϵ-stationary point at a convergence rate of O(ϵ−4) without relying on compactness or Constraint Qualification (CQ). When CQ holds, this convergence is measured by approximately satisfying the Karush-Kuhn-Tucker conditions. …

    jhu Repository record for FIRST-ORDER METHODS FOR NONSMOOTH NONCONVEX FUNCTIONAL CONSTRAINED OPTIMIZATION WITH OR WITHOUT SLATER POINTS (opens in a new tab)

  5. A study of relatively weakly convex optimization models and their extensions

    … algorithms, including the Bregman proximal subgradient method, Bregman stochastic proximal point method, Bregman stochastic proximal subgradient method, and Bregman stochastic prox-linear method. The convergence properties of these methods are established under mild assumptions. Extensions …

    umn Repository record for A study of relatively weakly convex optimization models and their extensions (opens in a new tab)

  6. Stochastic programming approaches to air traffic flow management under the uncertainty of weather

    … the intractability, we suggest a rolling horizon method to solve the problem to near optimal. Lagrangian relaxation and subgradient method are used to justify the rolling horizon method. Since the rolling horizon method can be solved in real time, we can apply it to actual aircraft schedules to …

    gatech Repository record for Stochastic programming approaches to air traffic flow management under the uncertainty of weather (opens in a new tab)

  7. Structured Low Rank Matrix Optimization Problems: A Penalty Approach

    … addressed. We further present a general proximal subgradient method for the purpose of solving the penalized problem. Finally, we design a quadratically convergent smoothing Newton-BiCGStab method to solve the resulted sub-problems. Numerical results indicate that our approach is able to handle …

    nus Repository record for Structured Low Rank Matrix Optimization Problems: A Penalty Approach (opens in a new tab) Download file for Structured Low Rank Matrix Optimization Problems: A Penalty Approach (opens in a new tab)

  8. Distributed online algorithms for energy management in smart grids

    … for distributed economic dispatch based on Subgradient method and Alternating Direction Method of Multipliers (ADMM), both designed to be agnostic with any initialization vector. The proposed distributed online solutions leverage a dynamic average consensus algorithm to track the …

    utc Repository record for Distributed online algorithms for energy management in smart grids (opens in a new tab)

  9. Optimisation models and algorithms for multicast message routing and power control in wireless multihop networks

    … coupled structure of the problem. We implement a subgradient method for solving the dual problem, and then look at ways to accelerate its convergence. We also investigate the behaviour and convergence of a simple but effective primal co-ordinate descent method before numerically investigating its …

    birmingham Download PDF for Optimisation models and algorithms for multicast message routing and power control in wireless multihop networks (opens in a new tab)

  10. Combatting ill-conditioning and heavy-tailed noise in non-convex optimization

    … challenge for optimization with first-order methods. This is especially the case for stochastic optimization, where the classical preconditioners - designed to compensate ill-conditioned curvatures - are hard to construct due to the inherent variability of stochastic gradients. Compounding …

    cornell Repository record for Combatting ill-conditioning and heavy-tailed noise in non-convex optimization (opens in a new tab)

  11. Bregman generalized subgradient projected algorithms and applications

    Projected subgradient methods were thought as ideal algorithms for constrained minimization problems. But they are often hampered by the computational complexity of the projection operator. The generalized Bregman distance has been identified as a potential solution to this issue. This thesis …

    ubc Repository record for Bregman generalized subgradient projected algorithms and applications (opens in a new tab) Download PDF for Bregman generalized subgradient projected algorithms and applications (opens in a new tab)

  12. First-order methods for structured optimization

    First-order methods are gaining substantial interest in the past two decades because of their superior performance in solving today's large-scale problems. In this thesis, we study some widely used first-order methods for problems that satisfy certain structures. Specifically, in the first part, we …

    ubc Repository record for First-order methods for structured optimization (opens in a new tab) Download PDF for First-order methods for structured optimization (opens in a new tab)

  13. Optimization of Cable Harness Routing

    … is utilized in the solution process. A deflected subgradient method is used to solve the Lagrangian dual problem, and to provide upper and lower bounds on the optimal objective value. Ergodic sequences of the Lagrangian subproblem solutions are utilized for branching decisions during the …

    chalmers Repository record for Optimization of Cable Harness Routing (opens in a new tab)

  14. A Novel Approach to Transmission Power, Lifetime and Connectivity Optimization in Asymmetric Networks

    … and the mixed interior point-exterior point methods are utilized to transform these constrained optimization problems into sequential optimization problems. Given the new formulation, each subproblem is then solved numerically via the subgradient method with backtracking line search. A …

    concordia Download PDF for A Novel Approach to Transmission Power, Lifetime and Connectivity Optimization in Asymmetric Networks (opens in a new tab)

  15. Sequentially connected 2D assignment problems solved using Lagrangian dual methods

    … the optimal value. We have implemented two methods to quantify MOT algorithms, multi-block ADMM, and a subgradient method. Our results show that both algorithms work well and scale linearly with the number of time steps and cubic with the number of estimates and ground truths. Thanks to a …

    chalmers Repository record for Sequentially connected 2D assignment problems solved using Lagrangian dual methods (opens in a new tab)

  16. Virtual topology optimization in wavelength routed optical networks

    … programming (ILP) formulations and a solution methodology employing Lagrangean Relaxation and Subgradient Method (LRSM). We are able to provide a good bound at the same time as obtaining a sub-optimal solution, with reasonable time complexity. We prove the efficiency and the easy adaptation of …

    ottawa-retro Repository record for Virtual topology optimization in wavelength routed optical networks (opens in a new tab)

  17. Towards Efficient and Fair Radio Resource Allocation Schemes for Interference-Limited Celluar Networks

    … problem is amenable to powerful optimization methods, including the primal-decomposition method, the projected-subgradient method, and the network-flow optimization methods. Using these optimization methods, we propose a polynomial-time distributed ICIC scheme that finds a near-optimum …

    carleton Repository record for Towards Efficient and Fair Radio Resource Allocation Schemes for Interference-Limited Celluar Networks (opens in a new tab)

  18. Accelerated first-order optimization methods using inertia and error bounds

    … applications. The focus is on first-order methods which have low per-iteration complexity and can exploit problem structure to a high degree. First-order methods have the capacity to address large-scale problems for which all alternative methods fail. However, first-order methods can take …

    uiuc Repository record for Accelerated first-order optimization methods using inertia and error bounds (opens in a new tab)

  19. Distributed Algorithms for Solving Linear Algebraic Equations & Convex Optimization Problems

    … are inspired by the well known distributed subgradient method. We show that the proposed network flows are guaranteed to converge asymptotically to the global minimizer under given conditions. Next, we introduce two saddle-point type distributed algorithms to improve the rate of convergence …

    queens Repository record for Distributed Algorithms for Solving Linear Algebraic Equations & Convex Optimization Problems (opens in a new tab)

Page 1 of 2