Back to search

University of Waterloo

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

Abstract

dc:description.abstract

In this thesis, we study the effects of applying a modified Levenberg-Marquardt regularization to a nonsmooth Newton method. We expand this application to exact and inexact 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 provides us with insight into an external path following algorithm that, like the simplex method, takes a finite number of steps on the boundary of the polyhedral set. However, unlike the simplex method, these steps do not use basic feasible solutions.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Weames, Tyler
Advisor dc:contributor.advisor
  • Wolkowicz, Henry

Subjects

dc:subject × 10

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/20179

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Weames, Tyler. Nonsmooth Newton Methods for Solving the Best Approximation Problem; with Applications to Linear Programming. University of Waterloo, 2023. http://hdl.handle.net/10012/20179