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 36 for “"Line Search"”.

  1. 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 …

    vt Repository record for Adaptive Sampling Line Search for Simulation Optimization (opens in a new tab)

  2. A Dark Matter line search using 3D-modeling of Cherenkov showers below 10 TeV with VERITAS

    … by such telescopes, e.i., a monoenergetic line at the same energy as the particle mass. This so called ”smoking-gun” signature is sought with a sliding window line search within the sub-range ∼ 0.3 − 10 TeV of the VERITAS energy range, ∼ 0.01 − 30 TeV. Standard analysis within the VERITAS …

    potsdam-diss Repository record for A Dark Matter line search using 3D-modeling of Cherenkov showers below 10 TeV with VERITAS (opens in a new tab)

  3. On Deep Network Optimization

    … computational resources, motivating research into improving the efficiency and effectiveness of the optimization process. We focus on two optimization aspects in this thesis:<br /> First, Improving the gradient descent procedure used in every deep learning pipeline using the classical …

    bielefeld Repository record for On Deep Network Optimization (opens in a new tab)

  4. 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 …

    vt Repository record for Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems (opens in a new tab)

  5. An automated reliable method for two-dimensional Reynolds-Averaged Navier-Stokes simulations

    … drives toward an improved discretization; a non-linear solver technique based on pseudo-time continuation and line-search update limiting which improves the robustness for solutions to the RANS equations; and a simplex cut-cell mesh generation which autonomously provides higher-order meshes of …

    mit Repository record for An automated reliable method for two-dimensional Reynolds-Averaged Navier-Stokes simulations (opens in a new tab)

  6. Ein Verfahren der sequentiellen, konvexen Optimierung mit kombinierter Trust-Region- und Moving-Asymptotes-Stabilisierung zur Lösung nichtlinearer, restringierter Optimierungsprobleme

    … kontinuierlicher und restringierter nichtlinearer Optimierungsprobleme (NLP) wird vorgestellt, das die Approximation der "Method of Moving Asymptotes" (MMA) mit einer Trust-Region-Strategie kombiniert. Als Trust-Region für diese Methode wird das Gebiet zwischen den MMA-Asymptoten abzüglich …

    bayreuth Repository record for Ein Verfahren der sequentiellen, konvexen Optimierung mit kombinierter Trust-Region- und Moving-Asymptotes-Stabilisierung zur Lösung nichtlinearer, restringierter Optimierungsprobleme (opens in a new tab)

  7. Experimental analysis on the operation of Particle Swarm Optimization

    … the swarms particles are in good regions of the search space with the potential to make more progress, the introduction of perturbations to the pbest positions can lead to significant improvements in the performance of standard Particle Swarm Optimization. The pbest perturbation has been …

    york Repository record for Experimental analysis on the operation of Particle Swarm Optimization (opens in a new tab)

  8. A strictly feasible sequential convex programming method

    … problem can be solved by numerous efficient nonlinear optimization methods, for example sequential convex programming methods. Sequential convex programming (SCP) formulates separable and strictly convex nonlinear subproblems iteratively by approximating the objective and the constraints. Lower …

    bayreuth Repository record for A strictly feasible sequential convex programming method (opens in a new tab)

  9. New variational principles with applications to optimization theory and algorithms

    … of the Newton-type to solve systems of nonlinear equations. We propose and justify a new generalized Newton algorithm based on graphical derivatives. Based on advanced tools of variational analysis and generalized differentiation, we establish the well-posedness and convergence results of …

    wayne-thes Repository record for New variational principles with applications to optimization theory and algorithms (opens in a new tab)

  10. Volumetric mesh parameterization to a canonical template

    … Local injectivity is enforced via constrained line search during gradient descent. We evaluate the proposed method in the context of a twin pregnancy study that includes MRI scans of seven women. We achieve sub-voxel accuracy in mapping the boundary of the placenta to the template, while …

    mit Repository record for Volumetric mesh parameterization to a canonical template (opens in a new tab)

  11. Análise elasto-plástica da construção de aterros

    … points of each element. In the elastic nonlinear analysis the formula proposed by Duncan and Chang (1970) is used and for the Poisson's ratio the exponential formulation published by Lade (1972) is applied. In the elasto-plastic analysis the formula proposed by Drucker and Prager (1952) and …

    brazil-uerj Repository record for Análise elasto-plástica da construção de aterros (opens in a new tab)

  12. A structured reduced sequential quadratic programming and its application to a shape design problem

    … the block structure in the Jacobian of the linearized constraints is exploited by decomposing the variables into the design and flow parts. To achieve this, Sequential quadratic programming with BFGS update for the reduced Hessian of the Lagrangian function is used with Variable reduction …

    vt Repository record for A structured reduced sequential quadratic programming and its application to a shape design problem (opens in a new tab)

  13. Optimal sublot determination in multiple batch stage, two stage production systems

    … dimension problem which allows the use of a line search method. A continuous optimal solution is generated and an algorithm is proposed to deduce an integer solution from it. The results of the two-batch problem are then generalized to the multiple batch/two-machine case, which is solved for …

    vt Repository record for Optimal sublot determination in multiple batch stage, two stage production systems (opens in a new tab)

  14. Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems

    … the use of standard convex differentiable nonlinear programming algorithms that are guaranteed to converge to KKT solutions. The second equivalent differentiable formulation is derived via a Lagrangian dual approach based on the optimum of a linear function over a unit ball (circle). For this …

    vt Repository record for Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems (opens in a new tab)

  15. Scaling rank-one updating formula and its application in unconstrained optimization

    … the quadratic termination property with inexact line search. A new algorithm (OCSSRl) is presented, in which the scaling parameter in SSRl is choosen automatically by satisfying Davidon's criterion for an optimaly conditioned Hessian estimate. Numerical tests show that the new method compares …

    aus-cath Repository record for Scaling rank-one updating formula and its application in unconstrained optimization (opens in a new tab)

  16. Scaling rank-one updating formula and its application in unconstrained optimization

    … the quadratic termination property with inexact line search. A new algorithm (OCSSRl) is presented, in which the scaling parameter in SSRl is choosen automatically by satisfying Davidon's criterion for an optimaly conditioned Hessian estimate. Numerical tests show that the new method compares …

    anu Repository record for Scaling rank-one updating formula and its application in unconstrained optimization (opens in a new tab)

  17. The development of a modular finite element program for analysis of soil-structure interaction

    … include two global convergence algorithms: the line search and the dogleg search. Use of a consistent tangent stress-strain matrix for formulating the stiffness matrix, and its influence on convergence, is discussed. Approximate methods for calculating the consistent tangent stress-strain matrix …

    vt Repository record for The development of a modular finite element program for analysis of soil-structure interaction (opens in a new tab)

  18. Fault detection and path optimisation for a meat-processing robot

    … by the Automation Systems team of Industrial Research Limited. This robotic device performs the Y-cut operation on sheep carcasses. The robotic Y-cutting system must deal with a variety of carcass shapes and sizes, and it is important that process faults are detected, diagnosed and corrected as …

    waikato-masters Repository record for Fault detection and path optimisation for a meat-processing robot (opens in a new tab)

  19. Aspects of computational contact dynamics

    … to the formalism of Contact Dynamics. Hybrid linearisation, parameter scaling and line search techniques are combined as the global convergence enhancements of the Newton algorithm. Quasi-static simulations of dry masonry assemblies exemplify performance of the presented framework.

    glasgow Repository record for Aspects of computational contact dynamics (opens in a new tab)

  20. Modeling and control of antilock braking systems utilizing dynamic friction tire model

    … controllers. The novelty of the present research is in the utilization and formulation of a new dynamic friction tire model for the development and testing of designed controller. Due to complex mechanics of tires, the dynamic friction tire model is significantly more realistic than that of …

    concordia Repository record for Modeling and control of antilock braking systems utilizing dynamic friction tire model (opens in a new tab)

Page 1 of 2