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 32 for “"convex minimization"”.

  1. Greedy Strategies for Convex Minimization

    … for finding an approximation to the minimum of a convex function E, defined on a Hilbert space H. We have proved convergence rates for a modification of the orthogonal matching pursuit and its weak version under suitable conditions on the objective function E. These conditions involve the behavior …

    tamu Repository record for Greedy Strategies for Convex Minimization (opens in a new tab)

  2. Convex minimization and phase field models

    … relies on a reformulation of the problem as dual minimization problem whose energy functional is differentiable. The gradient of this functional turns out to be the nonlinear Schur complement of the saddle point problem. Generalized linearizations for the Schur complement are derived and used for …

    fu-berlin Repository record for Convex minimization and phase field models (opens in a new tab)

  3. Random projection methods for stochastic convex minimization

    … focus of this thesis is to solve a stochastic convex minimization problem over an arbitrary family of nonempty, closed and convex sets. The problem has random features. Gradient or subgradient of objective function carries stochastic errors. Number of constraint sets can be extensive or …

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

  4. Fixed Point Methods in Convex Minimization for Large Data

    … problem x0 ∈ arg min_{x∈C} f (x) on a suitable convex and closed domain C ⊆ R^n stemming from a machine learning problem based on training data X := {d^(i), y^(i)}^{N}_{i=1} whereby the objective function is a regularized mean square error. Here, the objective function belongs to the important …

    brock Repository record for Fixed Point Methods in Convex Minimization for Large Data (opens in a new tab)

  5. Some Algorithms for Large-Scale Linear and Convex Minimization in Relative Scale

    … solving large-scale linear and nonsmooth convex minimization problems within a prescribed relative error $\delta$ of the optimum. The methods we propose converge in $O(1/\delta^2)$ or $O(1/\delta)$ iterations of a first-order type. While the theoretical lower iteration bound for …

    cornell Repository record for Some Algorithms for Large-Scale Linear and Convex Minimization in Relative Scale (opens in a new tab)

  6. Finite element discretization and iterative solution of total variation regularized minimization problems and application to the simulation of rate-independent damage evolutions

    … of efficient and reliable numerical methods for minimization problems including a total variation term is challenging due to the non-differentiability of the total variation.<br><br>An overview of existing numerical methods for a finite element discretization of a popular (bilaterally …

    freiburg-diss Repository record for Finite element discretization and iterative solution of total variation regularized minimization problems and application to the simulation of rate-independent damage evolutions (opens in a new tab)

  7. Information, complexity and structure in convex optimization

    … on the limits of performance of large-scale convex optimization algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin in 1983, successfully established the worst-case behavior of methods based on local oracles (a generalization of first-order oracle for …

    gatech Repository record for Information, complexity and structure in convex optimization (opens in a new tab)

  8. Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization

    Consider a class of convex minimization problems for which the objective function is the sum of a smooth convex function and a non-smooth convex regularity term. This class of problems includes several popular applications such as compressive sensing and sparse group LASSO. In this thesis, we …

    umn Repository record for Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization (opens in a new tab)

  9. Applications of accuracy certificates for problems with convex structure

    … of accuracy certificates for problems with convex structure This dissertation addresses the efficient generation and potential applications of accuracy certificates in the framework of “black-box-represented” convex optimization problems - convex problems where the objective and the …

    gatech Repository record for Applications of accuracy certificates for problems with convex structure (opens in a new tab)

  10. On properties of the order-based cost function in assemble-to-order systems

    … inventory system satisfies a discrete convexity property called L♮-convexity. Based on this result, Lu and Song proposed two types of L♮-convex minimization algorithms for finding the optimum policy. We construct a simple assemble-to-order system for which the cost function fails to …

    ubc Repository record for On properties of the order-based cost function in assemble-to-order systems (opens in a new tab) Download PDF for On properties of the order-based cost function in assemble-to-order systems (opens in a new tab)

  11. A Finite Approximation Framework for Infinite Dimensional Functional Problems

    … MBS transforms the complicated functional minimization of PR, to a finite parameter, discrete convex minimization allowing us to leverage the tools of modern convex optimization. We show applications of MBS for both univariate and multivariate regression with a number of explicit examples …

    washington Repository record for A Finite Approximation Framework for Infinite Dimensional Functional Problems (opens in a new tab)

  12. PERFORMANCE ANALYSIS OF OPTIMIZATION ALGORITHMS USING SEMIDEFINITE PROGRAMMING

    … optimization algorithms for unconstrained convex minimization problems. Through our method, we derive worst-case upper bounds on the convergence rates of the algorithms, over a fixed class of functions. Our approach is based on sum-of-squares optimization, which allow us to introduce a …

    nus Repository record for PERFORMANCE ANALYSIS OF OPTIMIZATION ALGORITHMS USING SEMIDEFINITE PROGRAMMING (opens in a new tab) Download file for PERFORMANCE ANALYSIS OF OPTIMIZATION ALGORITHMS USING SEMIDEFINITE PROGRAMMING (opens in a new tab)

  13. On integrated plant, control and guidance design

    … are formulated in terms of the solution to a convex minimization problem utilizing LMIs and used to size the horizontal control surfaces. The second method addresses the problem of tracking inertial trajectories with applications for unmanned air vehicles. This problem is posed and solved …

    nps Repository record for On integrated plant, control and guidance design (opens in a new tab)

  14. Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms

    … and all elements. Greedy algorithms in convex optimization have been of particular interest recently. We discuss algorithms that do not use the derivative of the objective function, and thus offer an alternative to traditional methods of convex minimization. We recall two known …

    south-carolina Repository record for Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms (opens in a new tab)

  15. Existence, uniqueness and regularity of solutions to elastic-plastic problems with the traction boundary condition

    … equivalently as variational inequalities or minimization problems. In the first linear elastic-plastic model of Havner-Patel type, the existence of weak solutions is obtained by using an elliptic regularization method. Moreover, the solution is shown to be unique up to an infinitesimal rigid …

    utk-theses Repository record for Existence, uniqueness and regularity of solutions to elastic-plastic problems with the traction boundary condition (opens in a new tab)

  16. Convex optimization under inexact first-order information

    … complexity analysis of the algorithms to solve convex programming problems under inexact first-order information. In the first part of this thesis we focus on the general non-smooth convex minimization under a stochastic oracle. We start by introducing an important algorithmic advancement in …

    gatech Repository record for Convex optimization under inexact first-order information (opens in a new tab)

  17. Finite Difference Methods in Imaging and Inverse Problems

    … the impact of alternative ND methods. A proper convex minimization algorithm is proposed to utilize the latter filters to recover images from their degraded measurements. Furthermore, the problem of optical flow in computer vision is considered in this thesis. A comparative study is represented …

    toronto-retro Repository record for Finite Difference Methods in Imaging and Inverse Problems (opens in a new tab)

Page 1 of 2