It is well known that global optimization problems are, generally speaking, computationally infeasible, that is solving them would require an unreasonably large amount of time and/or space. In certain cases, for example, when objective functions and constraints are convex, it is possible to construct a feasible algorithm for solving global optimization problem successfully. Convexity, however, is not a phenomenon to be often expected in the applications. Nonconvex problems frequently arise in many industrial and scienti¯c areas. Therefore, it is only natural to try to replace convexity with some other structure at least for some classes of nonconvex optimization problems to render the global optimization problem feasible. A theory of abstract convexity has been developed as a result of the above considerations. Monotonic analysis, a branch of abstract convex analysis, is analogous in many ways to convex analysis, and sometimes is even simpler. It turned out that many problems of nonconvex optimization encountered in applications can be described in terms of monotonic functions. The analogies with convex analysis were considered to aid in solving some classes of nonconvex optimization problems. In this thesis we will focus on one of the elements of monotonic analysis - Increasing Positively Homogeneous functions of degree one or in short IPH functions. The aim of present research is to show that finding the solution and ²-approximation to the solution of the global optimization problem for IPH functions restricted to a unit simplex is an NP-hard problem. These results can be further extended to positively homogeneous functions of degree ´, ´ > 0. / Master of Mathematical Sciences (Research)

Thesis (Ph. D.)--University of Washington, 2007. / Vita. Includes bibliographical references (p. 104-107).

Thesis (Ph. D.)--University of Toronto, 2006. / Source: Dissertation Abstracts International, Volume: 67-06, Section: B, page: 3254. Includes bibliographical references.

Thesis (M.Sc.). / Title from title page of PDF (viewed 2008/01/30). Written for the School of Computer Science. Includes bibliographical references.

Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 172-179). Also available via the Internet.

Thesis (M.S.)--Rochester Institute of Technology, 1991. / Typescript. Includes bibliographical references.

Thesis (Ph. D.)--University of Sydney, 2003. / Title from title screen (viewed 16 April 2008). Submitted in fulfilment of the requirements for the degree of Doctor of Philosophy to the School of Information Technologies, Faculty of Science. Includes bibliographical references. Also available in print form.

Thesis (M.S.)--University of Delaware, 2008. / Principal faculty advisor: Robert G. Hunsperger, Dept. of Electrical & Computer Engineering. Includes bibliographical references.

Thesis (doctoral)--University of Passau, 2007. / Description based on print version record. Includes bibliographical references (p. [127]-133).

Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1993. / Vita. Abstract. Includes bibliographical references (leaves 139-151). Also available via the Internet.