Gør som tusindvis af andre bogelskere
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.Du kan altid afmelde dig igen.
There has been much recent progress in global optimization algo- rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun- damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon- vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en- dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by the General Secretariat of Research and Tech- nology of Greece, by the Ministry of Education of Greece, and several local Greek government agencies and companies. This volume contains a selective collection of refereed papers based on invited and contribut- ing talks presented at this conference. The two themes of convexity and global optimization pervade this book. The conference provided a forum for researchers working on different aspects of convexity and global opti- mization to present their recent discoveries, and to interact with people working on complementary aspects of mathematical programming.
Various generalizations of the classical concept of a convex function have been introduced, especially during the second half of the 20th century. Generalized convex functions are the many nonconvex functions which share at least one of the valuable properties of convex functions. Apart from their theoretical interest, they are often more suitable than convex functions to describe real-word problems in disciplines such as economics, engineering, management science, probability theory and in other applied sciences. More recently, generalized monotone maps which are closely related to generalized convex functions have also been studied extensively. While initial efforts to generalize convexity and monotonicity were limited to only a few research centers, today there are numerous researchers throughout the world and in various disciplines engaged in theoretical and applied studies of generalized convexity/monotonicity (see http://www.genconv.org).The Handbook offers a systematic and thorough exposition of the theory and applications of the various aspects of generalized convexity and generalized monotonicity. It is aimed at the non-expert, for whom it provides a detailed introduction, as well as at the expert who seeks to learn about the latest developments and references in his research area. Results in this fast growing field are contained in a large number of scientific papers which appeared in a variety of professional journals, partially due to the interdisciplinary nature of the subject matter. Each of its fourteen chapters is written by leading experts of the respective research area starting from the very basics and moving on to the state of the art of the subject. Each chapter is complemented by a comprehensive bibliography which will assist the non-expert and expert alike.
There has been much recent progress in global optimization algo rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by the General Secretariat of Research and Tech nology of Greece, by the Ministry of Education of Greece, and several local Greek government agencies and companies. This volume contains a selective collection of refereed papers based on invited and contribut ing talks presented at this conference. The two themes of convexity and global optimization pervade this book. The conference provided a forum for researchers working on different aspects of convexity and global opti mization to present their recent discoveries, and to interact with people working on complementary aspects of mathematical programming.
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.