Back to search

Clemson University

A Stochastic Global Optimization Program

Abstract

dc:description.abstract

The global optimization problem is usually stated as the global minimization problem, which is to find a point x* ϵ S, a compact set in ʀⁿ, such that f(x*) ≤ f (x) ∀ x ϵ S. Much work has been done on functions satisfying various convexity conditions. The global minimization problem drops this requirement, allowing for multiple local minima. We will follow the standard assumption that f is continuous and that is has continuous first and second derivatives. The problem shall either be unconstrained or have simple bounds on the variables. A maximization problem is easily converted to a minimization problem by negating f.

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
  • Wofford, Richard K.
Contributors dc:contributor
  • Jerry Nedelman

Identifiers

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

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

Wofford, Richard K.. A Stochastic Global Optimization Program. Thesis thesis, https://open.clemson.edu/arv_theses/121