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 23 for “"trust region algorithm"”.
-
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 …
-
Advanced Parametric Modeling and Yield Optimization Approaches for Microwave Passive Components
… sensitivity-analysis-based pole/zero-matching algorithm is proposed have fast and reliable predictions for the poles/zeros subject to large geometrical variations, consequently increasing the accuracy of the overall model. In the second part of this thesis, we propose a novel surrogate-assisted …
-
A global convergence theory for a class of trust region algorithms for constrained optimization
In this research we present a trust region algorithm for solving the equality constrained optimization problem. This algorithm is a variant of the 1984 Celis-Dennis-Tapia algorithm. The augmented Lagrangian function is used as a merit function. A scheme for updating the penalty parameter is …
-
Multi-fidelity algorithms for the horizontal alignment problem in road design
… high accuracy simultaneously. In particular, the algorithms that use the multi-fidelity technique in their design adaptively controls the error of the objective function. As they reach better positions in the search space, they update the objective function and use a new version with better …
-
An Approach for the Adaptive Solution of Optimization Problems Governed by Partial Differential Equations with Uncertain Coefficients
… adaptive sparse grid interpolation and employs trust regions to manage the adapted stochastic collocation models. Furthermore, I prove the convergence of sparse grid collocation methods applied to these optimization problems as well as the global convergence of the retrospective trust region …
-
Q-fully quadratic modeling and its application in a random subspace derivative-free method
… models. This thesis proposes a random subspace trust-region algorithm based on quadratic approximations. Unlike most of its precursors, this algorithm does not require any special form of objective function. We study the geometry of sample sets, the error bounds for approximations, and the …
-
Numerical analysis for derivative-free optimization
… methods. This thesis presents novel theory and algorithms in both categories. Model-based methods often approximate the gradient or the Hessian of the objective function. The properties of the gradient approximation technique called generalized simplex gradient are scrutinized. Second, two …
-
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 …
-
Optimization and control of reservoir models using system identification and machine learning tools
… into a sequence of linear programs using a trust region algorithm, maximizing Net Present Value, which is an objective function representing the overall economic performance of the production process. Additional significant contributions, developed in the course of this dissertation, include …
-
A trust-region method for nonlinear bilevel optimisation problems with an application in transportation
… into two main contributions. First, a novel trust-region approach to solving nonlinear bilevel problems is proposed, which solves an exact penalisation of the optimal value reformulation. Second, an application of bilevel programming to the London congestion pricing problem is explored, …
-
Revenue management with customer choice and sellers competition
… and therefore matters. We present a stochastic trust region algorithm for estimating ML-type models that involve high-dimensional integrals. The algorithm embeds two sampling processes: (i) a data sampling process and (ii) a Monte Carlo sampling process, and the algorithm dynamically controls …
-
Modeling A Market For Natural Catastrophe Insurance
… and acquisition; and (4) a state-ofthe-art regional catastrophe loss estimation model, all within the framework of a static Cournot-Nash noncooperative game assuming perfect information. We allow the number of primary insurers to increase from one (monopoly) to many (oligopoly) within the …
-
Sparse optimization problems in fractional order Sobolev spaces with L\(^p\)-regularization for p ∈ [0,1)
… is devoted to the development and analysis of algorithms to solve the optimization problems numerically. A majorize-minimization (MM) approach is studied that makes use of the smooth approximation of the L\(^p\)-functional. This method fits into a broader setting of composite DC algorithms, so …
-
On the Effect of Numerical Noise in Simulation-Based Optimization
… Convergence of gradient based optimization algorithms in the presence of numerical noise is not always assured. One way to improve optimization algorithm performance in the presence of numerical noise is to adjust the method of gradient computation. This study investigates the use of …
-
Effective and Efficient Optimization Methods for Kernel Based Classification Problems
… and solve the problem using a second-order trust region algorithm. To improve efficiency, we use the two-block Gauss-Seidel method, breaking the problem into a convex support vector machine subproblem and a non-convex feature selection subproblem. We reduce possibility of saddle point …
-
Higher-order Losses and Optimization for Low-level and Deep Segmentation
… are significantly weaker than more advanced algorithms. Yet, variants of the gradient descent dominate optimization of the loss functions for deep neural networks due to their size and complexity. Hence, standard segmentation networks still require an overwhelming amount of precise …
-
Tracking on manifolds : quasi-Newton optimisation algorithms on manifolds
… Many traditional unconstrained optimisation algorithms such as the steepest descent algorithm, the Newton's method and the trust region algorithm have be extended to Riemannian manifolds or smooth manifolds. However, little work has been done in quasi-Newton algorithms on manifolds. In 1982, …
-
Semi Analytical Approach for Binary Mixture Conductivity in Hydraulic Fracturing
… to stress. This practice creates a special region inside the fracture, in which two injected proppant types co-exist and is defined as the mixture zone. This research concentrates on the variability of the mixture zone under impact of different factors, introduces novel semi-analytical …
-
Mathematical models and analysis for demand side management in residential electricity distribution networks.
… academic literature. We first develop a control algorithm for Heating Ventilation Air-Conditioning (HVAC) systems in households during a peak period. The dynamic programming based model can determine the optimal temperature set-points of a thermostat given the lower and upper limits of …
-
Nonlinear Preconditioning Methods for Optimization and Parallel-In-Time Methods for 1D Scalar Hyperbolic Partial Differential Equations
… the gradient vector throughout the optimization algorithm. This framework is used to discuss previously developed nonlinearly preconditioned nonlinear GMRES and nonlinear conjugate gradients (NCG) algorithms, as well as to develop two new nonlinearly preconditioned quasi-Newton methods based on …
Page 1 of 2