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

dc.contributor.advisor	Bandler, John W.	en_US
dc.contributor.author	Charalambous, Christakis	en_US
dc.contributor.department	Biology	en_US
dc.date.accessioned	2014-06-18T16:44:14Z
dc.date.available	2014-06-18T16:44:14Z
dc.date.created	2011-03-29	en_US
dc.date.issued	1973-02	en_US
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>	en_US
dc.description.degree	Doctor of Philosophy (PhD)	en_US
dc.identifier.other	opendissertations/4033	en_US
dc.identifier.other	5050	en_US
dc.identifier.other	1908856	en_US
dc.identifier.uri	http://hdl.handle.net/11375/8863
dc.subject	Biology	en_US
dc.subject	Biology	en_US
dc.title	Nonlinear Least pth Approximation and Nonlinear Programming with Applications in the Design of Networks and Systems	en_US
dc.type	thesis	en_US

Files

Now showing 1 - 1 of 1