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 163 for “"Trust Region"”.
-
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 …
-
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 …
-
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 …
-
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 …
-
A generalized trust region SQP algorithm for equality constrained optimization
We introduce and analyze a class of generalized trust region sequential quadratic programming (GTRSQP) algorithms for equality constrained optimization. Unlike in standard trust region SQP (TRSQP) algorithms, the optimization subproblems arising in our GTRSQP algorithm can be generated from models …
-
New Trust Region SQP Methods for Continuous and Integer Optimization
… To obtain global convergence, techniques of trust region methods are employed by the new algorithms. The first version of an algorithm for MINLPs presented in this thesis employs the Linf-penalty function as merit function. Applying this penalty function might lead to a slow convergence. The …
-
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 …
-
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 …
-
Trust-region interior-point algorithms for a class of nonlinear programming problems
This thesis introduces and analyzes a family of trust-region interior-point (TRIP) reduced sequential quadratic programming (SQP) algorithms for the solution of minimization problems with nonlinear equality constraints and simple bounds on some of the variables. These nonlinear programming problems …
-
Unitary Transformation And Trust-Region Optimization Of Localized Orbitals Using Riemannian Manifolds
… spaces. To overcome this drawback, we applied Trust Region algorithm on orthonormal Riemannian manifold with an approximate retraction from the tangent space built into first and second derivatives of the cost function. Moreover, the Riemannian Trust Region outer iterations were coupled to …
-
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 …
-
A Trust Region Strategy for Nonlinear Equality Constrained Optimization (Nonlinear Programming, Sequential Quadratic)
… program. In unconstrained optimization, trust region strategies have been very successful. In this thesis we present a new approach for equality constrained optimization problems based on a trust region strategy. The direction selected is not necessarily the solution of the standard …
-
Trust-region SQP methods with inexact linear system solves for large-scale optimization
… the global convergence analysis of a class of trust-region sequential quadratic programming (SQP) algorithms for smooth nonlinear optimization to allow for an efficient integration of inexact linear system solvers. Each iteration within an SQP method requires the solution of several linear …
-
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, …
-
A large-scale trust-region approach to the regularization of discrete ill-posed problems
We consider the problem of computing the solution of large-scale discrete ill-posed problems when there is noise in the data. These problems arise in important areas such as seismic inversion, medical imaging and signal processing. We pose the problem as a quadratically constrained least squares …
-
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 …
-
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 …
-
A global convergence theory for a general class of trust region algorithms for equality constrained optimization
… global convergence results for a broad class of trust region sequential quadratic programming algorithms for the smooth nonlinear programming problem with equality constraints. The family of algorithms to which our results apply is characterized by very mild conditions on the normal and …
Page 1 of 9