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 12 of 12 for “"Trust region subproblem"”.

  1. Efficient Trust Region Subproblem Algorithms

    The Trust Region Subproblem (TRS) is the problem of minimizing a quadratic (possibly non-convex) function over a sphere. It is the main step of the trust region method for unconstrained optimization problems. Two cases may cause numerical difficulties in solving the TRS, i.e., (i) the so-called …

    waterloo Repository record for Efficient Trust Region Subproblem Algorithms (opens in a new tab)

  2. Regularization Using a Parameterized Trust Region Subproblem

    … problems that extends the traditional trust-region approach. Ill-conditioned problems arise, for example, in image restoration or mathematical processing of medical data, and involve matrices that are very ill-conditioned. The method makes use of the L-curve and L-curve maximum …

    waterloo Repository record for Regularization Using a Parameterized Trust Region Subproblem (opens in a new tab)

  3. A survey of the trust region subproblem within a semidefinite framework

    Trust region subproblems arise within a class of unconstrained methods called trust region methods. The subproblems consist of minimizing a quadratic function subject to a norm constraint. This thesis is a survey of different methods developed to find an approximate solution to the subproblem. We …

    waterloo Repository record for A survey of the trust region subproblem within a semidefinite framework (opens in a new tab)

  4. A robust trust region algorithm for nonlinear programming

    This paper develops and tests a trust region algorithm for the nonlinear equality constrained optimization problem. Our goal is to develop a robust algorithm that can handle lack of second-order sufficiency away from the solution in a natural way. Celis, Dennis and Tapia (1985) give a trust region …

    rice Repository record for A robust trust region algorithm for nonlinear programming (opens in a new tab)

  5. Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας

    … results are applied in the large scale trust region subproblem for calculating nearly exact solutions as well as in a curvilinear search that uses a Quasi-Newton and a negative curvature direction. The new method is drastically reducing the spatial complexity of known algorithms of …

    greece Repository record for Μαθηματικές μέθοδοι βελτιστοποίησης προβλημάτων μεγάλης κλίμακας (opens in a new tab)

  6. Relaxações tratáveis para problemas de otimização cúbicos restritos à esfera

    … quadratic problem, which is the well-known trust region subproblem, can be solved efficiently since it has a concave dual problem with no duality gap. In the literature, several relaxation techniques have been studied to polynomials problems, based on RLT inequalities and via Semidefinite …

    brazil-uerj Repository record for Relaxações tratáveis para problemas de otimização cúbicos restritos à esfera (opens in a new tab)

  7. Applications of Conic Programming Reformulations

    … In one chapter, we consider two variants of the trust-region subproblem. For each of these variants, we show that their feasible regions can be written as the union of two sub-regions with known lifted convex hulls. We are then able to use this fact to reformulate each variant into a semidefinite …

    clemson Repository record for Applications of Conic Programming Reformulations (opens in a new tab)

  8. Stable Local Volatility Calibration Using Kernel Splines

    … vectors. In this thesis we also propose a trust region method to determine the coefficient vector in the proposed optimization formulation. In this algorithm, the main computation of each iteration is reduced to solving a standard trust region subproblem. To deal with the non-differentiable …

    waterloo Repository record for Stable Local Volatility Calibration Using Kernel Splines (opens in a new tab)

  9. Numerical optimization with applications to machine learning

    … is based on repeated solutions of the famous Trust-Region Subproblem, for which we derive novel results regarding the existence and the computation of its local-nonglobal minimizer. The resulting algorithm was demonstrated to be useful in sparse PCA and sequential quadratic programming.

    oxford Repository record for Numerical optimization with applications to machine learning (opens in a new tab)

  10. New Hardware and Software Design for Electrical Impedance Tomography

    … problem. The proposed approach is based on the trust region subproblem (TRS), which uses L-curve maximum curvature criteria to fmd a regularization parameter. Our results show that the TRS algorithm has the advantage that it does not require any knowledge of the norm of the noise for its …

    mcmaster Repository record for New Hardware and Software Design for Electrical Impedance Tomography (opens in a new tab)

  11. ADAPTIVE LOCAL REDUCED BASIS METHOD FOR RISK-AVERSE PDE CONSTRAINED OPTIMIZATION AND INVERSE PROBLEMS

    … then combine our local RB method with an inexact trust region method to eciently solve risk-averse optimization problems with PDE constraints. We propose a numerical framework for systematically constructing surrogate models for the trust-region subproblem and the objective function using local RB …

    duke Repository record for ADAPTIVE LOCAL REDUCED BASIS METHOD FOR RISK-AVERSE PDE CONSTRAINED OPTIMIZATION AND INVERSE PROBLEMS (opens in a new tab)

  12. Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming

    … of method for solving large-scale ``low-rank' trust region subproblems was proposed by completely avoiding the computations of Cholesky or partial Cholesky factorizations. A computational study of this method was also provided by applying it to solve some large-scale nonlinear programming …

    gatech Repository record for Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming (opens in a new tab)