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 154 for “"Line Search"”.
-
Adaptive Sampling Line Search for Simulation Optimization
… with existing SO algorithms, we develop ADALINE, a line search based algorithm that eliminates the need for any user defined parameters. ADALINE is designed to identify a local minimum on continuous and integer ordered feasible sets. ADALINE on a continuous feasible set mimics deterministic …
-
Line search based inverse lithography technique for mask design
… much, and it causes many problems, such as poly line end shortening or bridging which result in leakage or short circuit. The industry has been investigating various alternatives, such as EUV(extreme ultra-violet) illumination source. However, the next generation of illumination source, EUV with …
-
A Taylor polynomial expansion line search for large-scale optimization
… problem of how to efficiently conduct univariate line searches in commodity clusters in the context of gradient-based batch optimization algorithms, like the staple limited-memory BFGS (LBFGS) method. In it, a new line search technique is proposed for cases where the underlying objective function …
-
Line Search Based Optimization using Function Approximations with Tunable Accuracy
This thesis develops a line-search algorithm that incorporates approximate objec- tive function and gradient information to solve smooth unconstrained optimization problems. This algorithm is motivated by the need to rigorously incorporate reduced order models (ROMs) into the solution of …
-
A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value
This research proposes a novel method of improving the Gradient Descent method in an effort to be competitive with applications of the conjugate gradient method while reducing computation per iteration. Iterative methods for unconstrained optimization have found widespread application in digital …
-
Theory And Algorithms For Structured Nonsmooth Optimization
… how BFGS (in this case with an exact line search) typically succeeds despite nonsmoothness. We then explore, computationally, the behavior of the BFGS method with an inexact line search on the same example, and discuss the results. In further support of the heuristic effectiveness of …
-
A Comparative Study of Non Linear Conjugate Gradient Methods
We study the development of nonlinear conjugate gradient methods, Fletcher Reeves (FR) and Polak Ribiere (PR). FR extends the linear conjugate gradient method to nonlinear functions by incorporating two changes, for the step length αk a line search is performed and replacing the residual, rk …
-
Decision Space Decomposition for Multiobjective Programs
… MOPs de- composing their decision space into lines. The line decomposition benefits from the fact that a multiobjective line search problem is equivalent to solving a collection of single objective line search problems. In the presence of one objective function, no modifications of the method …
-
Interpolation, growth conditions, and stochastic gradient descent
… further shown that stochastic acceleration and line-search methods for step-size selection are possible in this restricted setting. Although pioneering, existing analyses for first-order methods under interpolation have two major weaknesses: they are restricted to the finite-sum setting, and, …
-
Optimization Algorithms for PDE-Constrained Optimization with Inexact Models
This thesis develops line-search algorithms that incorporate approximate objective function and gradient information to solve smooth optimization problems. These algorithms are motivated by the need to rigorously incorporate reduced order models (ROMs) into the solution of large-scale optimization …
-
A Technique for the Optimization of Actuation Characteristics of Ionic Polymer-Metal Composites
… Polymers (EAPs), which are an actively-researched class of electromechanical actuators. IPMCs are similar in function to piezoelectric actuators, however require substantially lower input voltage, requiring as little as 1V to actuate, and with a very high maximum no-load strain of over …
-
A hybrid direct search and model-based derivative-free optimization method with dynamic decision processing
… hybrid method capable of performing direct search, quadratic-model search, and line search all in the same method. We develop a series of different direct search, quadratic-model search, and line search strategies within this framework. The benchmark results indicate that each of these …
-
Optimization techniques for a multi-dimensional drilling model.
The method of Hooke and Jeeves using Fibonacci line search has been used to solve the non-linear, multi-variable, unconstrained, objective function. A comparison between the Hooke and Jeeves searching method and other optimization techniques, such as discrete Hooke and Jeeves and Rosenbrock methods …
-
Νέοι αλγόριθμοι εκπαίδευσης τεχνητών νευρωνικών δικτύων και εφαρμογές
… [81]. The algorithm uses the steepest descent search direction while the learning rate parameter is calculated by minimizing the standard secant equation [5]. Furthermore, a new learning rate parameter is derived by minimizing the modified secant equation introduced in [90], that uses both …
-
Noisy Optimization and Online Prediction : Approaches of Gradient Descent and State-space Models
… focuses on noisy optimization problems and online prediction in nonstationary environment using Gaussian time-varying linear models. For noisy optimization problems, we propose an algorithm based on gradient descent and its extension to Nesterov's gradient descent. We also study the …
-
Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems
This research effort focuses on large-scale linear programming problems that arise in the context of solving various problems such as discrete linear or polynomial, and continuous nonlinear, nonconvex programming problems, using linearization and branch-and-cut algorithms for the discrete case, and …
-
A Trust Region Strategy for Nonlinear Equality Constrained Optimization (Nonlinear Programming, Sequential Quadratic)
Many current algorithms for nonlinear constrained optimization problems determine a search direction by solving a quadratic programming subproblem. The global convergence properties are addressed by using a line search technique and a merit function to modify the length of the step obtained from …
-
Particle swarm optimization for energy minimization of molecular systems
… type can be challenging for deterministic (e.g. line search) optimization algorithms due to the size of the search space and the large number of local minima that are inherent within molecular configuration problems. We describe how Particle Swarm Optimization, a stochastic optimization algorithm …
-
Two Affine Scaling Methods for Solving Optimization Problems Regularized with an L1-norm
… that we want to minimize is usually a highly nonlinear function of a set of model parameters with the regularization term. Typically monotonic decreasing algorithm is adopted to solve this minimization problem. Steepest descent or Newton type algorithms are two iterative methods but they are …
-
Three-Dimensional Aerodynamic Design Optimization Using Discrete Sensitivity Analysis and Parallel Computing
… time associated with the sequential 1-D line search in gradient-based aerodynamic optimization, an alternative parallel approach was developed. The execution time of the new approach was reduced effectively to that of one flow analysis, regardless of the number of function evaluations in …
Page 1 of 8