Back to search

McMaster University

Nonlinear Least pth Approximation and Nonlinear Programming with Applications in the Design of Networks and Systems

Abstract

dc:description.abstract

<p>The purpose of this thesis is to present a unified treatment of nonlinear least pth and nonlinear minimax approximation problems, and a new method for nonlinear programming. Least pth approximation with values of p in the range 1,000 to 1,000,000 in conjunction with the Fletcher-Powell and Fletcher algorithms have been successfully applied to a variety of network and system optimization problems. A comparison is made between two new ~lgorithrns for nonlinear minimax approximation and some of the existing ones. Also, the new approach to nonlinear programming is compared with the well-known SUMT. A critical review of unconstrained optimization is also included.</p>

Degree

thesis:*
Department dc:contributor.department
Biology
Year dc:date.issued
1973

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Charalambous, Christakis
Advisor dc:contributor.advisor
  • Bandler, John W.

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/4033
5050
1908856

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Charalambous, Christakis. Nonlinear Least pth Approximation and Nonlinear Programming with Applications in the Design of Networks and Systems. 1973. http://hdl.handle.net/11375/8863