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 20 for “"Trust-Region Methods"”.

  1. Trust Region Methods for Training Neural Networks

    … was performed into the behaviour of trust region methods, a type of second order numerical optimization method, when used to train ff-ANNs on several datasets. Our study compares a classical trust region approach and evaluates the effect of adapting this method using stochastic …

    waterloo Repository record for Trust Region Methods for Training Neural Networks (opens in a new tab)

  2. Global convergence of trust region methods for minimizing a nondifferentiable function

    Three fundamental convergence properties of trust region (TR) methods for solving nonsmooth unconstrained minimization problems are considered in this paper. The first is to prevent the false termination of the TR iterates, $i.e.$, if the optimal solution of the TR subproblem is at the current …

    rice Repository record for Global convergence of trust region methods for minimizing a nondifferentiable function (opens in a new tab)

  3. A Global Convergence Theory for Arbitrary Norm Trust Region Methods for Nonlinear Equations

    … can be used in the objective function and in the trust region constraint. The algorithm is shown to be globally convergent. This research was motivated by the recent work of Duff, Nocedal and Reid. A key point in our analysis is that the tools from nonsmooth analysis, namely locally Lipschitz …

    rice Repository record for A Global Convergence Theory for Arbitrary Norm Trust Region Methods for Nonlinear Equations (opens in a new tab)

  4. Adaptive sampling trust-region methods for derivative-based and derivative-free simulation optimization problems

    … ASTRO, which is an adaptive sampling based trust-region optimization method where a stochastic local model is constructed, optimized, and updated iteratively. ASTRO is a derivative-based algorithm and provides almost sure convergence to a first-order critical point with good practical …

    purdue-thes Repository record for Adaptive sampling trust-region methods for derivative-based and derivative-free simulation optimization problems (opens in a new tab)

  5. Efficient numerical algorithms for virtual design in nanoplasmonics

    … driving a need for efficient numerical methods. In this work, integral equations are used to efficiently solve the electromagnetic transmission problem at the interface of a dielectric and a periodic metal nanostructure. Derivative-free trust-region methods are then used to optimize the …

    umn Repository record for Efficient numerical algorithms for virtual design in nanoplasmonics (opens in a new tab)

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

  7. Local and Global Convergence for Convex-Composite Optimization

    … data analysis and machine learning. Almost all methods for solving this problem involve direction finding subproblems based on linearizing the smooth function c at some current iterate. When h is the identity function on the real line, these direction finding subproblems correspond to steepest …

    washington Repository record for Local and Global Convergence for Convex-Composite Optimization (opens in a new tab)

  8. Mathematical Software for Multiobjective Optimization Problems

    … are combined, including surrogate modeling, trust region methods, and adaptive weighting. The result is a numerical software package that finds approximately Pareto optimal solutions that are evenly distributed across the Pareto front, using minimal cost function evaluations. The second …

    vt Repository record for Mathematical Software for Multiobjective Optimization Problems (opens in a new tab)

  9. Solution of non-linear problems in structural mechanics by optimization methods

    … The focus of this thesis is hence to investigate methods by which convergence might be improved. Two main ideas have been investigated: 1) Include dynamics since failure is in reality a dynamic process, and 2) Use methods from the related field of optimization. For this purpose, the mechanical …

    chalmers Repository record for Solution of non-linear problems in structural mechanics by optimization methods (opens in a new tab)

  10. Two Affine Scaling Methods for Solving Optimization Problems Regularized with an L1-norm

    … or Newton type algorithms are two iterative methods but they are local, i.e., they use derivative information around the current iterate to find the next iterate. In order to ensure convergence, line search and trust region methods are two widely used globalization techniques. Motivated by …

    waterloo Repository record for Two Affine Scaling Methods for Solving Optimization Problems Regularized with an L1-norm (opens in a new tab)

  11. New Trust Region SQP Methods for Continuous and Integer Optimization

    … class of sequential quadratic programming (SQP) methods. Two problem formulations that arise frequently in real-world applications are considered. Both have in common that functions are nonlinear and the formulations contain equality and inequality constraints. For the one class of problems the …

    bayreuth Repository record for New Trust Region SQP Methods for Continuous and Integer Optimization (opens in a new tab)

  12. Discrete Adjoints: Theoretical Analysis, Efficient Computation, and Applications

    … first-order critical points for a whole class of trust-region methods. Here, the usage of inexact Jacobian matrices allows a considerable reduction of the computational complexity.

    qucosa-diss

  13. Multistage quadratic stochastic programming

    … that are active at the point. Generalized Newton methods with linesearch are proposed for solving multistage quadratic stochastic programs. The algorithms converge globally. If the piecewise quadratic objective is differentiable and strictly convex at the solution, then convergence is also finite. …

    unsw Repository record for Multistage quadratic stochastic programming (opens in a new tab)

  14. Nonconvex and Nonsmooth Inverse Problems

    … particular, we develop a family of splitting methods that first relaxes key parts of the inverse problem, and then solves an augmented problem with improved numerical properties and easier analyzation. Our key application is seismic inversion, with more additional applications to data …

    washington Repository record for Nonconvex and Nonsmooth Inverse Problems (opens in a new tab)

  15. Numerical optimization for mixed logit models and an application

    In this thesis an algorithm (MLOPT) for mixed logit models is proposed. Mixed logit models are flexible discrete choice models, but their estimation with large datasets involves the solution of a nonlinear optimization problem with a high dimensional integral in the objective function, which is the …

    gatech Repository record for Numerical optimization for mixed logit models and an application (opens in a new tab)

  16. Methods for the integrated design of viscoelastic materials and structural geometry

    … sequential linear programming, and trust-region methods (Chapter 3), and novel efficient sampling and implicit constraint generation methods for multiobjective surrogate-based optimization for challenging problems (Chapter 4). The chapters in Part II present integrated design studies …

    uiuc Repository record for Methods for the integrated design of viscoelastic materials and structural geometry (opens in a new tab)

  17. Τεχνικές βελτίωσης της αποδοτικότητας αλγορίθμων επίλυσης προβλημάτων βελτιστοποίησης χωρίς περιορισμούς

    … still very important, despite the fact that many methods have already been proposed.The subject of this dissertation is to find the optimum solutions for unconstrained optimization problems using iterative methods. A major problem with many iterative optimization algoristhms is the fact that their …

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

  18. ON THE COMPUTATION AND APPLICATION OF MULTI-PERIOD SECURITY-CONSTRAINED OPTIMAL POWER FLOW FOR REAL-TIME ELECTRICITY MARKET OPERATIONS

    … problem is studied. Three techniques, namely, a trust-region based augmented Lagrangian method, a step-controlled primal-dual interior point method, and a modified constrained cost variables method, are developed for reliable and efficient computation of large-scale nonsmooth optimal power flows. …

    cornell Repository record for ON THE COMPUTATION AND APPLICATION OF MULTI-PERIOD SECURITY-CONSTRAINED OPTIMAL POWER FLOW FOR REAL-TIME ELECTRICITY MARKET OPERATIONS (opens in a new tab)

  19. Analýza nejistot inverzního problému vedení tepla ve dvou prostorových souřadnicích

    This dissertation examines an inverse heat conduction problem (IHCP) approach to approximate the transient heat transfer coefficient (HTC) distribution on the cooling surface of a high-pressure die casting (HPDC) die insert. We design a synthetic numerical experiment to produce internal temperature …

    brno-tech Repository record for Analýza nejistot inverzního problému vedení tepla ve dvou prostorových souřadnicích (opens in a new tab)