Back to search

Clemson University

Solving Polynomial Optimization Problem and Noncooperative Games by a Homotopy Algorithm

Abstract

dc:description.abstract

The problem of finding all the solutions of a system of m polynomials in m variables is studied in this paper. Unlike earlier studies (6, 8, 18), optimization and game problems are the focus. This paper checks solutions, compares function evaluations whenever possible, and presents absolute error as well for future comparisons. The computer package used was HOMPACK [17], a FORTRAN implementation of a homotopy continuation algorithm. A new relaxation approach using complementarity theory to set up the first-order necessary conditions results in a system of m polynomials in m variables which subsequently can be solved by HOMPACK.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematical Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kinard, Laura A.
Contributors dc:contributor
  • Michael M. Kostreia

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/arv_theses/134

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Kinard, Laura A.. Solving Polynomial Optimization Problem and Noncooperative Games by a Homotopy Algorithm. Thesis thesis, https://open.clemson.edu/arv_theses/134