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 91 for “"Unconstrained optimization"”.
-
Mixed nonderivative algorithms for unconstrained optimization
… developed to restart nonderivative algorithms in unconstrained optimization. Application of the technique is shown to result in mixed algorithms which are considerably more robust than their component procedures. A general mixed algorithm is developed and its convergence is demonstrated. A uniform …
-
Symbolic Generation of Parallel Solvers for Unconstrained Optimization
… We show how parallelization and other optimizations are encoded as rules which are applied automatically rather than schemes that need to be implemented by the programmer in the low-level implementation. Finally, we present results, both in terms of numerical results and computational …
-
Artificial neural networks for constrained and unconstrained optimization
Thesis (Ph. D.)--Michigan State University. Department of Electrical Engineering, 1992
-
SELF-SCALING PARALLEL QUASI-NEWTON METHODS FOR NONLINEAR UNCONSTRAINED OPTIMIZATION
… can be efficiently applied to solve all types of optimization problems. One way to improve the efficiency of QN methods is to develop the parallel version of these algorithms. In this thesis, a new self-scaling parallel quasi-Newton method (SSPQN) for nonlinear optimization problems is proposed. …
-
Scaling rank-one updating formula and its application in unconstrained optimization
This thesis deals with algorithms used to solve unconstrained optimization problems. We analyse the properties of a scaling symmetric rank one (SSRl) update, prove the convergence of the matrices generated by SSRl to the true Hessian matrix and show that algorithm SSRl possesses the quadratic …
-
Dynamic, unconstrained optimization of secreted enzyme production in fed-batch fermentation using reinforcement learning
… temperature) but has yet to be demonstrated for unconstrained product maximization. In this work we develop a fed-batch fermentation model (digital twin) of Aspergillus niger secreting amylase using the Monod model, known literature parameters, and assumed constants to align with typical …
-
A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value
… computation per iteration. Iterative methods for unconstrained optimization have found widespread application in digital signal processing applications for large inverse problems, such as the use of conjugate gradient for parallel image reconstruction in MR Imaging. In these problems, very good …
-
Data-Driven Characterization and Optimization of Transport Phenomena in Digitally Reconstructed Porous Materials
… advances in data-driven characterization and optimization of digitally reconstructed porous media. This document covers contributions to the digital reconstruction of porous media, the digital characterization of effective properties and geometric features of porous media, and the data-driven …
-
Primal and Dual Gap Functions for Generalized Nash Equilibrium Problems and Quasi-Variational Inequalities
… a corresponding GNEP or QVI as a constrained or unconstrained optimization problem. Depending on the problem type, the primal reformulation uses regularized Nikaido-Isoda or regularized gap function approaches. For player convex GNEPs and QVIs of the so-called generalized `moving set' type the …
-
Development and application of multistep computational techniques for constrained and unconstrained mathematical functions
… the fact that these concepts can be extended to unconstrained optimization problems, and by penalty formulations, also to constrained optimization problems. This holds true not only for steepest descent methods but also for any other "improving direction." In the discussion of the application of …
-
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 …
-
The Clarke Derivative and Set-Valued Mappings in the Numerical Optimization of Non-Smooth, Noisy Functions
… tool for the convergence analysis of numerical optimization methods. It is based on the concepts of the Clarke derivative and set-valued mappings. Our goal is to apply this tool to minimization problems with non-smooth and noisy objective functions. After deriving a necessary condition for …
-
Qualitative and quantitative optimization of skylights : a comprehensive and inclusive analysis of skylight sizes for an office while providing enough daylight, avoiding glare and saving energy
… are proposed in this dissertation, encompassing unconstrained optimization, constrained optimization and monetary metrics. In the unconstrained optimization approach, the algorithmic platform has been developed to implement Parametric Analysis (PA) and Gradient Descent (GD) methods in order to …
-
Optimization of sail design
… problems. The first problem deals with an unconstrained optimization of the lift. Then, to develop the second problem, we introduce an integrated form of Stratford's separation criterion as a limiting constraint. Throughout the work, we incorporate a vortex lattice analysis to determine the …
-
Nonlinear Least pth Approximation and Nonlinear Programming with Applications in the Design of Networks and Systems
… applied to a variety of network and system optimization problems. A comparison is made between two new ~lgorithrns for nonlinear minimax approximation and some of the existing ones. Also, the new approach to nonlinear programming is compared with the well-known SUMT. A critical review of …
-
Understanding Adaptivity in Machine Learning Optimization: Theories and Algorithms
Optimization plays an indispensable role in modern machine learning, due to its necessity in many aspects, especially in model training. Over the past decade, the rapid development of research in deep machine learning models posed many new challenges for machine learning optimization. As a result, …
-
Line Search Based Optimization using Function Approximations with Tunable Accuracy
… 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 large-scale optimization problems governed by partial differential equations. The developed …
Page 1 of 5