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 4 of 4 for “"best approximation problem"”.

  1. Nonsmooth Newton Methods for Solving the Best Approximation Problem; with Applications to Linear Programming

    … nonsmooth Newton methods and apply it to the best approximation constrained to a polyhedral set problem. We also demonstrate that linear programs can be represented as a best approximation problem, extending the application of nonsmooth Newton methods to linear programming. This application …

    waterloo Repository record for Nonsmooth Newton Methods for Solving the Best Approximation Problem; with Applications to Linear Programming (opens in a new tab)

  2. Circumcenter operators in Hilbert spaces

    The best approximation problem is of central importance in convex optimization. It is popular to use the Douglas--Rachford splitting method or the method of alternating projections to solve this problem. In this thesis, we use a classical concept, circumcenter, in Euclidean geometry to solve the …

    ubc Repository record for Circumcenter operators in Hilbert spaces (opens in a new tab) Download PDF for Circumcenter operators in Hilbert spaces (opens in a new tab)

  3. An investigation of the use of gradients in imaging, including best approximation and the Structural Similarity image quality measure

    … model of perception. We solve the associated best approximation problem and discuss examples in both one- and two-dimensions. Motivated by the success of the SSIM, we also solve the Weberized best approximation problem with an added regularization term involving the correlation. Another …

    waterloo Repository record for An investigation of the use of gradients in imaging, including best approximation and the Structural Similarity image quality measure (opens in a new tab)

  4. Linear programming and best approximation

    The problem discussed in this paper is that of finding a best approximation to a given real-valued function f(x) over a continuum by means of finding a best approximation over a discrete set of points. We are also seeking to find a numerical method of finding a best approximation over our discrete …

    bu Repository record for Linear programming and best approximation (opens in a new tab) Embargoed until 2999-01-01