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 29 for “"subgradients"”.

  1. Subgradients of algebraically convex functions: a Galois connection relating convex sets and subgradients of convex functions

    <p>Subgradients of convex functions have been defined in classical analysis for the Euclidean spaces. Here we describe a Galois connection between convex upsets and maximal homomorphisms (which are subgradient values), and interpret traditional results in terms of universal algebra, noting that …

    iastate Repository record for Subgradients of algebraically convex functions: a Galois connection relating convex sets and subgradients of convex functions (opens in a new tab)

  2. New Bounding Methods for Global Dynamic Optimization

    … of iterations required by branch-and-bound. Subgradients, as useful local sensitivities of convex relaxations, are typically required by nonsmooth optimization solvers to effectively minimize these relaxations. This thesis develops novel techniques for efficiently computing tight convex …

    mcmaster Repository record for New Bounding Methods for Global Dynamic Optimization (opens in a new tab)

  3. Subgradient formulas for optimal control problems with constant dynamics

    … We show that the Proximal and Fréchet subgradients of the minimal time function are computed in terms of normal vectors to level sets. And we also computed the subgradients of the minimal time function in terms of the F-projection. Secondly, we consider the value function for Bolza …

    lsu-thes Repository record for Subgradient formulas for optimal control problems with constant dynamics (opens in a new tab)

  4. Quasiconvex optimization via generalized gradients and symmetric duality

    … programming problems are studied using Clarke's subgradients. Several conditions sufficient for optimality are derived. Under certain regularity conditions on the constraint functions, we also prove that a modified version of the classical Karush-Kuhn-Tucker conditions is both necessary and …

    uiuc Repository record for Quasiconvex optimization via generalized gradients and symmetric duality (opens in a new tab)

  5. Monotonicity Of Set-Valued Mappings And Full Stability Of General Parametrical Variational Systems

    … involving nonsmooth base mappings and partial subgradients of prox-regular functions acting in Hilbert spaces. Employing advanced tools and techniques of second-order variational analysis allows us to establish complete characterizations of, as well as directly variable sufficient conditions …

    wayne-thes Repository record for Monotonicity Of Set-Valued Mappings And Full Stability Of General Parametrical Variational Systems (opens in a new tab)

  6. Subdifferentials and their applications

    … subgradient, and the sum rule for proximal subgradients to hold. We have also found a class of functions f that can be recovered up to a constant by the proximal subgradient of J or - J. Finally we provide some sufficient conditions for the existence of error bounds in terms of the above …

    uvic Repository record for Subdifferentials and their applications (opens in a new tab)

  7. Theory and algorithmic applications of the proximal mapping and Moreau envelope

    … necessitating an algorithm that does not require subgradients. Such algorithms rely on constructs such as the simplex gradient to obtain good-quality approximations of subgradients and use the approximations in derivative-free versions of the proximal routines. The present work is divided into …

    ubc Repository record for Theory and algorithmic applications of the proximal mapping and Moreau envelope (opens in a new tab) Download PDF for Theory and algorithmic applications of the proximal mapping and Moreau envelope (opens in a new tab)

  8. METRIC AND TAME GEOMETRY IN OPTIMIZATION

    … This engenders a subgradient-free development: subgradients are indirect in depicting structure and do not extend naturally to non-Euclidean settings. The development focuses on two ideas traditionally studied through subgradients. The first idea is identification: the phenomenon of a set being …

    cornell Repository record for METRIC AND TAME GEOMETRY IN OPTIMIZATION (opens in a new tab)

  9. Approximate subdifferential of piecewise linear-quadratic functions

    … be resolved with the help of subdifferentials. Subgradients generalize derivatives to nondifferentiable functions, which makes them one of the most useful and powerful instruments in nonsmooth optimization. However, they may come with a few limitations. Some limitations may be overcome by using …

    ubc Repository record for Approximate subdifferential of piecewise linear-quadratic functions (opens in a new tab) Download PDF for Approximate subdifferential of piecewise linear-quadratic functions (opens in a new tab)

  10. Discrete Fractional Hermite-Hadamard Inequality

    … optimization such as convexity of a function, subgradients, and the Karush-Kuhn-Tucker conditions. We close this thesis by two remarks for the future direction of the research in this area.

    wku-diss Repository record for Discrete Fractional Hermite-Hadamard Inequality (opens in a new tab)

  11. Response Time Reduction and Service Level Differentiation in Supply Chain Design: Models and Solution Approaches

    … estimation of the service-level function and its subgradients. The subgradients obtained from the simulation are used to generate cuts that are appended to the mixed integer programming model. We also present a near-exact matrix analytic procedure to validate the estimates of the service-level …

    waterloo Repository record for Response Time Reduction and Service Level Differentiation in Supply Chain Design: Models and Solution Approaches (opens in a new tab)

  12. Convex and Nonconvex Optimization Techniques for Multifacility Location and Clustering

    … is used for developing calculus rules for subgradients and Fenchel conjugates of convex functions that are not necessarily differentiable in locally convex topological and Banach spaces. These calculus rules are useful for further applications to nonsmooth optimization from both theoretical …

    portland-state Repository record for Convex and Nonconvex Optimization Techniques for Multifacility Location and Clustering (opens in a new tab)

  13. Saddle Avoidance, Asymptotic Normality, and Exponential Acceleration in Nonsmooth Optimization

    … develop two regularity conditions describing how subgradients interact with active manifolds and then show that they hold for a broad and generic class of functions. With these cornerstones, we demonstrate that when randomly perturbed or equipped with stochastic noise, subgradient methods only …

    cornell Repository record for Saddle Avoidance, Asymptotic Normality, and Exponential Acceleration in Nonsmooth Optimization (opens in a new tab)

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

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

    … is to derive tractable formulas for computing subgradients of optimal value functions, which are often nonsmooth and nonconvex, in nonlinear, quadratic, and linear programming settings. These results address a key challenge in applying first-order methods to such problems. In summary, this …

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

  16. Sensitivity Analysis of Convex Relaxations for Nonsmooth Global Optimization

    … results are computationally approachable: subgradients in this article can be calculated both by the vector forward AD mode and reverse AD mode. A proof-of-concept implementation in Matlab is discussed.

    mcmaster Repository record for Sensitivity Analysis of Convex Relaxations for Nonsmooth Global Optimization (opens in a new tab)

  17. Automated tools for analyzing uncertainty in nonlinear dynamic chemical process models

    … methods for global optimization employ subgradients of convex relaxations, to construct lower bounds that provide crucial global intuition. Recent results show that subgradients in dynamic optimization problems may be obtained by adapting standard forward or adjoint sensitivity …

    mcmaster Repository record for Automated tools for analyzing uncertainty in nonlinear dynamic chemical process models (opens in a new tab)

  18. Bounding Reachable Sets for Global Dynamic Optimization

    … subgradient-based solvers require gradients or subgradients to be furnished. Smooth convex relaxations would aid local optimization even more. To address these issues and improve the computational performance of global dynamic optimization, this thesis proposes several novel formulations for …

    mcmaster Repository record for Bounding Reachable Sets for Global Dynamic Optimization (opens in a new tab)

  19. A splitting algorithm for multistage stochastic programming with application to hydropower scheduling

    … theory including: duality theory, saddle points, subgradients, scenario trees, Fenchel conjugacy, dynamic programming and splitting methods for monotone operators.The algorithm is based on an application of Spingarn's operator splitting method to the saddle point problem associated with the MSP. …

    washington Repository record for A splitting algorithm for multistage stochastic programming with application to hydropower scheduling (opens in a new tab)

Page 1 of 2