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 9 of 9 for “"proximal methods"”.

  1. Proximal Methods for Nonconvex Composite Optimization Problems

    … function. In this thesis several numerical methods for solving such problems in finite-dimensional spaces are discussed, which are based on proximity operators. After some basic results from convex and nonsmooth analysis are summarized, a first-order method, the proximal gradient method, is …

    wurz-thes Repository record for Proximal Methods for Nonconvex Composite Optimization Problems (opens in a new tab)

  2. Second order proximal methods applied to elastic net penalised vector generalised linear models

    … separable non-differentiable part, second-order proximal methods are considered. For VGLMs, depending on the model, it may be more convenient to use the Fisher information matrix instead of the Hessian. Hence, we propose a proximal Fisher scoring method. Two examples are then investigated. The …

    oxford Repository record for Second order proximal methods applied to elastic net penalised vector generalised linear models (opens in a new tab)

  3. Proximal methods in medical image reconstruction and in nonsmooth optimal control of partial differential equations

    Proximal methods are iterative optimization techniques for functionals, J = J1 + J2, consisting of a differentiable part J2 and a possibly nondifferentiable part J1. In this thesis proximal methods for finite- and infinite-dimensional optimization problems are discussed. In finite dimensions, they …

    wurz-thes Repository record for Proximal methods in medical image reconstruction and in nonsmooth optimal control of partial differential equations (opens in a new tab)

  4. Modeling and Algorithms for Nonconvex TrajectoryGeneration Problems: From Constraint Reformulations and First-Order Proximal Methods to Structure-Exploiting Convex Solvers

    … dynamics and task constraints. Among various methods, optimization-based formulation is favored for its ability to integrate dynamics, constraints, and performance objectives within a unified framework. Although various optimization-based trajectory generation methods have been successfully …

    washington Repository record for Modeling and Algorithms for Nonconvex TrajectoryGeneration Problems: From Constraint Reformulations and First-Order Proximal Methods to Structure-Exploiting Convex Solvers (opens in a new tab)

  5. Distributed Energy-Saving Algorithms for Wireless Networks

    … sparsity of the solution by using the theory of proximal methods and present simulations for different scenarios. Our algorithms have application both in wired networks as well as in TDMA and 802.11 wireless networks.

    maynooth Download PDF for Distributed Energy-Saving Algorithms for Wireless Networks (opens in a new tab)

  6. Versatile Geometry Optimization with Hard Constraints

    … problems are nonlinear and require sophisticated methods to optimize. However, there are several challenges associated with common applications. Models used for natural materials and distortion metrics are prone to numerical instabilities. Large domains give rise to computationally expensive …

    umn Repository record for Versatile Geometry Optimization with Hard Constraints (opens in a new tab)

  7. Modeling, learning, and inference of high-dimensional asynchronous event data

    … elegantly inherits the advantages from both the proximal methods and the conditional gradient methods to solve the matrix rank minimization problem under different constraints. Finally, in the data streaming setting, we develop a Bayesian inference algorithm for inferring latent variables and …

    gatech Repository record for Modeling, learning, and inference of high-dimensional asynchronous event data (opens in a new tab)

  8. Iterative Methods for the Elasticity Imaging Inverse Problem

    … known as the “locking effect”. Alternative methods, such as mixed finite element methods, must be applied to overcome this complication. Using these methods, this work reposes the problem as a generalized saddle point problem along with a presentation of several optimization formulations, …

    rit Repository record for Iterative Methods for the Elasticity Imaging Inverse Problem (opens in a new tab)

  9. Nonconvex Optimization Methods Under Inexact Information

    … We introduce Inexact Reduced Gradient (IRG) methods for general smooth functions and Inexact Gradient Descent (IGD) methods for $\mathcal{C}^{1,1}_L$ functions with relative and absolute errors. Additionally, we develop Inexact Proximal Point and Inexact Proximal Gradient methods for weakly …

    wayne-thes Repository record for Nonconvex Optimization Methods Under Inexact Information (opens in a new tab)