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 5 of 5 for “"local superlinear convergence"”.

  1. On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence

    … over other approaches are: (1) robust global convergence, and (2) the ability to obtain high accuracy solutions in theory (and in practice, if the algorithms are properly implemented, and as long as numerical linear system solvers continue to provide high accuracy solutions) for well-posed …

    waterloo Repository record for On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence (opens in a new tab)

  2. Communication-efficient Second-order Optimization Methods on Modern Parallel Systems

    … quasi-Newton algorithm that can achieve local superlinear convergence that uses asynchronous communications to reduce communication overheads. We develop a novel framework for implementing asynchronous communication models on cloud systems that allows practitioners to implement and …

    toronto-retro Repository record for Communication-efficient Second-order Optimization Methods on Modern Parallel Systems (opens in a new tab)

  3. Load flow and optimal power flow in power distribution systems - application of Riemannian optimization and holomorphic embedding

    … descent at each iteration while maintaining a local superlinear convergence rate. The second solution method is a Riemannian Augmented Lagrangian Method (RALM) which applies to the OPF problem. The proposed solution approach exploits the geometrical properties of the power flow equations and …

    bu Repository record for Load flow and optimal power flow in power distribution systems - application of Riemannian optimization and holomorphic embedding (opens in a new tab)

  4. Constrained Optimization on Manifolds

    … composite step method to these spaces, and local superlinear convergence of the algorithm for first-order retractions is obtained. First, we test the algorithm in a constrained eigenvalue problem. Then, we consider numerical experiments on the mechanics of elastic inextensible rods. There, …

    bayreuth Repository record for Constrained Optimization on Manifolds (opens in a new tab)

  5. Theories and Algorithms for Efficient and Robust Sequential Decision Making

    … to the policy, yet are able to offer global convergence guarantees and oftentimes optimal computational and statistical complexities. Unlike traditional methods such as Q-learning, the developed methods here also admit natural variants to handle large-scale problems, and are capable of …

    gatech Repository record for Theories and Algorithms for Efficient and Robust Sequential Decision Making (opens in a new tab)