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 21 for “"Newton step"”.

  1. Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

    … The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of …

    gsu Repository record for Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems (opens in a new tab)

  2. Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems

    … old version is that it only requires feasibility steps. In the earlier version, each iteration consisted of one feasibility step and some centering steps (at most three in practice). The improved version guarantees that after one feasibility step, the new iterated point is feasible and close …

    gsu Repository record for Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems (opens in a new tab)

  3. Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

    … The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of …

    gsu Repository record for Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems (opens in a new tab)

  4. Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones

    … of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method …

    gsu Repository record for Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones (opens in a new tab)

  5. Exact and inexact Newton linesearch interior-point algorithms for nonlinear programming problems

    … of the local primal-dual interior-point Newton's method for nonlinear programming recently introduced by El-Bakry, Tapia, Tsuchiya, and Zhang. Our linesearch uses a new merit function and a new notion of centrality. We establish a global convergence theory and present rather promising …

    rice Repository record for Exact and inexact Newton linesearch interior-point algorithms for nonlinear programming problems (opens in a new tab)

  6. PARAMETER ESTIMATION FOR THE GENERALIZED GAUSSIAN NOISE MODEL

    … asymptotically consistent and efficient moment/Newton-step estimator.

    rice Repository record for PARAMETER ESTIMATION FOR THE GENERALIZED GAUSSIAN NOISE MODEL (opens in a new tab)

  7. Parallel Gauss-Newton method for CP decomposition

    In this thesis, we formulate the Gauss-Newton algorithm to make it viable for running on distributed memory architectures and comparative to Alternating least squares algorithm for CP decomposition. Alternating least squares may exhibit slow or no convergence, especially when high accuracy is …

    uiuc Repository record for Parallel Gauss-Newton method for CP decomposition (opens in a new tab)

  8. Neural space mapping methods for modeling and design of microwave circuits

    … the inverse mapping at each iteration. The NISM step simply consists of evaluating this neural network at the optimal empirical solution. NISM step is proved to be a quasi-Newton step when the amount of nonlinearity in the inverse neuromapping is small. NISM optimization is compared with other …

    mcmaster Repository record for Neural space mapping methods for modeling and design of microwave circuits (opens in a new tab)

  9. Existence and persistence of invariant objects in dynamical systems and mathematical physics

    … the algorithms require O(N) storage and a Newton step for the equilibrium equation requires only O(N log(N)) arithmetic operations. This numerical methods give rise to a criterion for the breakdown of quasi-periodic solutions. This criterion is presented in Chapter 4. In Chapter 5, we …

    texas Repository record for Existence and persistence of invariant objects in dynamical systems and mathematical physics (opens in a new tab)

  10. Distributed Newton-Seeking for Resource Allocation

    … function’s gradient and Hessian to implement Newton step dynamics. It is shown that the extremum-seeking approach yields asymptotic convergence of the primal and dual problem to a neighbourhood of the optimal values. We propose two strategies to solve finite resource allocation problems. The …

    queens Repository record for Distributed Newton-Seeking for Resource Allocation (opens in a new tab)

  11. Effective finite termination procedures in interior-point methods for linear programming

    … compute an exact solution in a finite number of steps. The addition of a finite termination procedure enables interior-point algorithms to generate highly accurate solutions for problems in which the ill-conditioning of the Jacobian in the neighborhood of the solution currently precludes such …

    rice Repository record for Effective finite termination procedures in interior-point methods for linear programming (opens in a new tab)

  12. Efficient Iterative Solution Algorithms For Numerical Models of Multiphase Flow

    … arising from the nutrient equation at each Newton step and from the momentum equation, respectively. In each case these are shown to be very efficient algorithms: when the preconditioning strategies are applied to practical problems, the CPU time and memory are demonstrated to scale almost …

    whiterose Download PDF for Efficient Iterative Solution Algorithms For Numerical Models of Multiphase Flow (opens in a new tab)

  13. Uncalibrated robotic visual servo tracking for large residual problems

    … visual servoing algorithms use quasi-Gauss-Newton methods which are effective for small residual problems. The solution used in this study switches between a full quasi-Newton method for large residual case and the quasi-Gauss-Newton methods for the small case. Visual servoing to handle …

    gatech Repository record for Uncalibrated robotic visual servo tracking for large residual problems (opens in a new tab)

  14. Modeling Systems from Measurements of their Frequency Response

    … low ones, it may diverge. Hence, incorporating a Newton step aims at making the iteration always convergent for "starting poles" chosen close to the solution. A connection between vector fitting and the Loewner framework is exhibited, which resolves the issue of choosing the starting poles.

    rice Repository record for Modeling Systems from Measurements of their Frequency Response (opens in a new tab)

  15. Multilevel-in-Time Methods for Optimal Control of PDEs and Training of Recurrent Neural Networks

    … Specifically, this thesis formulates a Gauss-Newton-type method and shows that the computation of the Gauss-Newton step can be formulated as the solution of a discrete-time linear quadratic optimal control problem. This formulation provides a connection with the multigrid-in-time methods …

    rice Repository record for Multilevel-in-Time Methods for Optimal Control of PDEs and Training of Recurrent Neural Networks (opens in a new tab)

  16. Efficient finite element simulation of full-system elastohydrodynamic lubrication problems

    … analyse a novel, optimal, preconditioner for the Newton linearization of this algebraic system, and to assess the development of efficient finite element meshes through both manual tuning and the use of adaptive mesh refinement based upon a posteriori error estimation and control. Throughout this …

    whiterose Download PDF for Efficient finite element simulation of full-system elastohydrodynamic lubrication problems (opens in a new tab)

  17. Newton-type and Partial Gradient Thresholding Algorithms for Sparse Signal Reconstruction

    … simplicity and low complexity. The key step of thresholding methods can be regarded as integrating a search direction in traditional nonlinear optimization method and a specific thresholding technique that generates sparse vectors. The primary work of the thesis is to propose several …

    birmingham Download PDF for Newton-type and Partial Gradient Thresholding Algorithms for Sparse Signal Reconstruction (opens in a new tab)

  18. Multiscale Modeling and Simulation of Deformation Accumulation in Fault Networks

    … fault networks. This thesis constitutes another step towards reliable earthquake prediction and quantitative hazard analysis. Its focus lies on developing a mathematical model for prototypical, layered fault networks on short time scales as well as their efficient numerical simulation. This …

    fu-berlin Repository record for Multiscale Modeling and Simulation of Deformation Accumulation in Fault Networks (opens in a new tab)

  19. Advancing High-Fidelity Neural Methods: Toward Fast and Accurate Solvers in Scientific Computing and Computational Fluid Dynamics

    … mediocre accuracy even on smooth problems. Gauss–Newton Natural Gradient Descent (GNNG) addresses this by discretising Gauss–Newton’s method in function space, yielding a natural gradient update that provably mimics function-space dynamics and achieves close to single-precision accuracy on the …

    trento Repository record for Advancing High-Fidelity Neural Methods: Toward Fast and Accurate Solvers in Scientific Computing and Computational Fluid Dynamics (opens in a new tab) Embargoed

  20. First-Order Algorithms for Unconstrained/Constrained Dynamic Games and Identification of Linear Dynamic Systems with Multiplicative Noise

    … current state and other players’ actions at each step, make the distinction between our unconstrained and constrained dynamic games. As in the single-agent case, only specific dynamic games can be solved exactly, so approximation algorithms are required. We focus on iterative numerical methods for …

    umn Repository record for First-Order Algorithms for Unconstrained/Constrained Dynamic Games and Identification of Linear Dynamic Systems with Multiplicative Noise (opens in a new tab)

Page 1 of 2