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 2 of 2 for “"path-following interior-point methods"”.

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

    Interior-point methods provide one of the most popular ways of solving convex optimization problems. Two advantages of modern interior-point methods over other approaches are: (1) robust global convergence, and (2) the ability to obtain high accuracy solutions in theory (and in practice, if the …

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

  2. Computational and Geometric Aspects of Linear Optimization

    … number of hyperplanes. Pivot-based simplex methods and central-path following interior point methods are the computationally most efficient algorithms to solve linear optimization instances. Discrete optimization further assumes that some of the variables are integer-valued. This …

    mcmaster Repository record for Computational and Geometric Aspects of Linear Optimization (opens in a new tab)