0
Your cart

Your cart is empty

Browse All Departments
Price
  • R100 - R250 (14)
  • R250 - R500 (6)
  • R500+ (1,847)
  • -
Status
Format
Author / Contributor
Publisher

Books > Science & Mathematics > Mathematics > Optimization > General

Optimization Methods in Electromagnetic Radiation (Paperback, Softcover reprint of the original 1st ed. 2004): Thomas S.... Optimization Methods in Electromagnetic Radiation (Paperback, Softcover reprint of the original 1st ed. 2004)
Thomas S. Angell, Andreas Kirsch
R2,974 Discovery Miles 29 740 Ships in 10 - 15 working days

This book considers problems of optimization arising in the design of electromagnetic radiators and receivers, presenting a systematic general theory applicable to a wide class of structures. The theory is illustrated with examples, and indications of how the results can be applied to more complicated structures. The final chapter introduces techniques from multicriteria optimization in antenna design. References to mathematics and engineering literature guide readers through the necessary mathematical background.

Optimal Control Methods for Linear Discrete-Time Economic Systems (Paperback, Softcover reprint of the original 1st ed. 1982):... Optimal Control Methods for Linear Discrete-Time Economic Systems (Paperback, Softcover reprint of the original 1st ed. 1982)
Y. Murata
R1,532 Discovery Miles 15 320 Ships in 10 - 15 working days

As our title reveals, we focus on optimal control methods and applications relevant to linear dynamic economic systems in discrete-time variables. We deal only with discrete cases simply because economic data are available in discrete forms, hence realistic economic policies should be established in discrete-time structures. Though many books have been written on optimal control in engineering, we see few on discrete-type optimal control. More over, since economic models take slightly different forms than do engineer ing ones, we need a comprehensive, self-contained treatment of linear optimal control applicable to discrete-time economic systems. The present work is intended to fill this need from the standpoint of contemporary macroeconomic stabilization. The work is organized as follows. In Chapter 1 we demonstrate instru ment instability in an economic stabilization problem and thereby establish the motivation for our departure into the optimal control world. Chapter 2 provides fundamental concepts and propositions for controlling linear deterministic discrete-time systems, together with some economic applica tions and numerical methods. Our optimal control rules are in the form of feedback from known state variables of the preceding period. When state variables are not observable or are accessible only with observation errors, we must obtain appropriate proxies for these variables, which are called "observers" in deterministic cases or "filters" in stochastic circumstances. In Chapters 3 and 4, respectively, Luenberger observers and Kalman filters are discussed, developed, and applied in various directions. Noticing that a separation principle lies between observer (or filter) and controller (cf."

Progress in Mathematical Programming - Interior-Point and Related Methods (Paperback, Softcover reprint of the original 1st ed.... Progress in Mathematical Programming - Interior-Point and Related Methods (Paperback, Softcover reprint of the original 1st ed. 1989)
Nimrod Megiddo
R1,518 Discovery Miles 15 180 Ships in 10 - 15 working days

The starting point of this volume was a conference entitled "Progress in Mathematical Programming," held at the Asilomar Conference Center in Pacific Grove, California, March 1-4, 1987. The main topic of the conference was developments in the theory and practice of linear programming since Karmarkar's algorithm. There were thirty presentations and approximately fifty people attended. Presentations included new algorithms, new analyses of algorithms, reports on computational experience, and some other topics related to the practice of mathematical programming. Interestingly, most of the progress reported at the conference was on the theoretical side. Several new polynomial algorithms for linear program- ming were presented (Barnes-Chopra-Jensen, Goldfarb-Mehrotra, Gonzaga, Kojima-Mizuno-Yoshise, Renegar, Todd, Vaidya, and Ye). Other algorithms presented were by Betke-Gritzmann, Blum, Gill-Murray-Saunders-Wright, Nazareth, Vial, and Zikan-Cottle. Efforts in the theoretical analysis of algo- rithms were also reported (Anstreicher, Bayer-Lagarias, Imai, Lagarias, Megiddo-Shub, Lagarias, Smale, and Vanderbei). Computational experiences were reported by Lustig, Tomlin, Todd, Tone, Ye, and Zikan-Cottle. Of special interest, although not in the main direction discussed at the conference, was the report by Rinaldi on the practical solution of some large traveling salesman problems. At the time of the conference, it was still not clear whether the new algorithms developed since Karmarkar's algorithm would replace the simplex method in practice. Alan Hoffman presented results on conditions under which linear programming problems can be solved by greedy algorithms.

Asymptotic Cones and Functions in Optimization and Variational Inequalities (Paperback, Softcover reprint of the original 1st... Asymptotic Cones and Functions in Optimization and Variational Inequalities (Paperback, Softcover reprint of the original 1st ed. 2003)
Alfred Auslender, Marc Teboulle
R3,457 Discovery Miles 34 570 Ships in 10 - 15 working days

This book provides a systematic and comprehensive account of asymptotic sets and functions from which a broad and useful theory emerges in the areas of optimization and variational inequalities. A variety of motivations leads mathematicians to study questions about attainment of the infimum in a minimization problem and its stability, duality and minmax theorems, convexification of sets and functions, and maximal monotone maps. For each there is the central problem of handling unbounded situations. Such problems arise in theory but also within the development of numerical methods. The book focuses on the notions of asymptotic cones and associated asymptotic functions that provide a natural and unifying framework for the resolution of these types of problems. These notions have been used largely and traditionally in convex analysis, yet these concepts play a prominent and independent role in both convex and nonconvex analysis. This book covers convex and nonconvex problems, offering detailed analysis and techniques that go beyond traditional approaches. The book will serve as a useful reference and self-contained text for researchers and graduate students in the fields of modern optimization theory and nonlinear analysis.

Subgame Consistent Economic Optimization - An Advanced Cooperative Dynamic Game Analysis (Hardcover, 2012): David W.K. Yeung,... Subgame Consistent Economic Optimization - An Advanced Cooperative Dynamic Game Analysis (Hardcover, 2012)
David W.K. Yeung, Leon A. Petrosyan
R1,626 Discovery Miles 16 260 Ships in 10 - 15 working days

Various imperfections in existing market systems prevent the free market from serving as a truly efficient allocation mechanism, but optimization of economic activities provides an effective remedial measure. Cooperative optimization claims that socially optimal and individually rational solutions to decision problems involving strategic action over time exist. To ensure that cooperation will last throughout the agreement period, however, the stringent condition of subgame consistency is required.

This textbook presents a study of subgame consistent economic optimization, developing game-theoretic optimization techniques to establish the foundation for an effective policy menu to tackle the suboptimal behavior that the conventional market mechanism fails to resolve.

Mixed Integer Nonlinear Programming (Hardcover, 2012): Jon Lee, Sven Leyffer Mixed Integer Nonlinear Programming (Hardcover, 2012)
Jon Lee, Sven Leyffer
R5,921 Discovery Miles 59 210 Ships in 10 - 15 working days

Many engineering, operations, and scientific applications include a mixture of discrete and continuous decision variables and nonlinear relationships involving the decision variables that have a pronounced effect on the set of feasible and optimal solutions. Mixed-integer nonlinear programming (MINLP) problems combine the numerical difficulties of handling nonlinear functions with the challenge of optimizing in the context of nonconvex functions and discrete variables. MINLP is one of the most flexible modeling paradigms available for optimization; but because its scope is so broad, in the most general cases it is hopelessly intractable. Nonetheless, an expanding body of researchers and practitioners - including chemical engineers, operations researchers, industrial engineers, mechanical engineers, economists, statisticians, computer scientists, operations managers, and mathematical programmers - are interested in solving large-scale MINLP instances.

Sensors: Theory, Algorithms, and Applications (Hardcover, 2012): Vladimir L Boginski, Clayton W. Commander, Panos M. Pardalos,... Sensors: Theory, Algorithms, and Applications (Hardcover, 2012)
Vladimir L Boginski, Clayton W. Commander, Panos M. Pardalos, Yinyu Ye
R2,977 Discovery Miles 29 770 Ships in 10 - 15 working days

The objective of this book is to advance the current knowledge of sensor research particularly highlighting recent advances, current work, and future needs. The goal is to share current technologies and steer future efforts in directions that will benefit the majority of researchers and practitioners working in this broad field of study.

Handbook of Optimization in Complex Networks - Communication and Social Networks (Hardcover, 2012): My T. Thai, Panos M.... Handbook of Optimization in Complex Networks - Communication and Social Networks (Hardcover, 2012)
My T. Thai, Panos M. Pardalos
R4,599 Discovery Miles 45 990 Ships in 10 - 15 working days

Complex Social Networks is a newly emerging (hot) topic with applications in a variety of domains, such as communication networks, engineering networks, social networks, and biological networks. In the last decade, there has been an explosive growth of research on complex real-world networks, a theme that is becoming pervasive in many disciplines, ranging from mathematics and computer science to the social and biological sciences. Optimization of complex communication networks requires a deep understanding of the interplay between the dynamics of the physical network and the information dynamics within the network. Although there are a few books addressing social networks or complex networks, none of them has specially focused on the optimization perspective of studying these networks. This book provides the basic theory of complex networks with several new mathematical approaches and optimization techniques to design and analyze dynamic complex networks. A wide range of applications and optimization problems derived from research areas such as cellular and molecular chemistry, operations research, brain physiology, epidemiology, and ecology.

Regularity Concepts in Nonsmooth Analysis - Theory and Applications (Hardcover, 2012): Messaoud Bounkhel Regularity Concepts in Nonsmooth Analysis - Theory and Applications (Hardcover, 2012)
Messaoud Bounkhel
R2,986 Discovery Miles 29 860 Ships in 10 - 15 working days

The results presented in this book are a product of research conducted by the author independently and in collaboration with other researchers in the field. In this light, this work encompasses the most recent collection of various concepts of regularity and nonsmooth analysis into one monograph. The first part of the book attempts to present an accessible and thorough introduction to nonsmooth analysis theory. Main concepts and some useful results are stated and illustrated through examples and exercises. The second part gathers the most prominent and recent results of various regularity concepts of sets, functions, and set-valued mappings in nonsmooth analysis. The third and final section contains six different application, with comments in relation to the existing literature.

Handbook on Semidefinite, Conic and Polynomial Optimization (Hardcover, 2012): Miguel F. Anjos, Jean B. Lasserre Handbook on Semidefinite, Conic and Polynomial Optimization (Hardcover, 2012)
Miguel F. Anjos, Jean B. Lasserre
R7,529 Discovery Miles 75 290 Ships in 10 - 15 working days

Semidefinite and conic optimization is a major and thriving research area within the optimization community. Although semidefinite optimization has been studied (under different names) since at least the 1940s, its importance grew immensely during the 1990s after polynomial-time interior-point methods for linear optimization were extended to solve semidefinite optimization problems.

Since the beginning of the 21st century, not only has research into semidefinite and conic optimization continued unabated, but also a fruitful interaction has developed with algebraic geometry through the close connections between semidefinite matrices and polynomial optimization. This has brought about important new results and led to an even higher level of research activity.

This "Handbook on Semidefinite, Conic and Polynomial Optimization "provides the reader with a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization, and polynomial optimization. It contains a compendium of the recent research activity that has taken place in these thrilling areas, and will appeal to doctoral" "students, young graduates, and experienced researchers alike.

The Handbook's thirty-one chapters are organized into four parts: "Theory," covering significant theoretical developments as well as the interactions between conic optimization and polynomial optimization;"Algorithms," documenting the directions of current algorithmic development;"Software," providing an overview of the state-of-the-art;"Applications," dealing with the application areas where semidefinite and conic optimization has made a significant impact in recent years.

Design and Analysis of Approximation Algorithms (Hardcover, 2012): Dingzhu Du, Ker-I Ko, Xiao-Dong Hu Design and Analysis of Approximation Algorithms (Hardcover, 2012)
Dingzhu Du, Ker-I Ko, Xiao-Dong Hu
R1,639 Discovery Miles 16 390 Ships in 10 - 15 working days

This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.

Discrete and System Models - Volume 3: Discrete and System Models (Paperback, Softcover reprint of the original 1st ed. 1983):... Discrete and System Models - Volume 3: Discrete and System Models (Paperback, Softcover reprint of the original 1st ed. 1983)
W.F. Lucas; Edited by (editors-in-chief) W.F. Lucas; Edited by F.S. Roberts, R.M. Thrall
R3,491 Discovery Miles 34 910 Ships in 10 - 15 working days

The purpose of this four volume series is to make available for college teachers and students samples of important and realistic applications of mathematics which can be covered in undergraduate programs. The goal is to provide illustrations of how modem mathematics is actually employed to solve relevant contemporary problems. Although these independent chapters were prepared primarily for teachers in the general mathematical sciences, they should prove valuable to students, teachers, and research scientists in many of the fields of application as well. Prerequisites for each chapter and suggestions for the teacher are provided. Several of these chapters have been tested in a variety of classroom settings, and all have undergone extensive peer review and revision. Illustrations and exercises be covered in one class, are included in most chapters. Some units can whereas others provide sufficient material for a few weeks of class time. Volume 1 contains 23 chapters and deals with differential equations and, in the last four chapters, problems leading to partial differential equations. Applications are taken from medicine, biology, traffic systems and several other fields. The 14 chapters in Volume 2 are devoted mostly to problems arising in political science, but they also address questions appearing in sociology and ecology. Topics covered include voting systems, weighted voting, proportional representation, coalitional values, and committees. The 14 chapters in Volume 3 emphasize discrete mathematical methods such as those which arise in graph theory, combinatorics, and networks.

High Performance Algorithms and Software in Nonlinear Optimization (Paperback, Softcover reprint of the original 1st ed. 1998):... High Performance Algorithms and Software in Nonlinear Optimization (Paperback, Softcover reprint of the original 1st ed. 1998)
Renato De Leone, Almerico Murli, Panos M. Pardalos, Gerardo Toraldo
R4,522 Discovery Miles 45 220 Ships in 10 - 15 working days

This book contains a selection of papers presented at the conference on High Performance Software for Nonlinear Optimization (HPSN097) which was held in Ischia, Italy, in June 1997. The rapid progress of computer technologies, including new parallel architec tures, has stimulated a large amount of research devoted to building software environments and defining algorithms able to fully exploit this new computa tional power. In some sense, numerical analysis has to conform itself to the new tools. The impact of parallel computing in nonlinear optimization, which had a slow start at the beginning, seems now to increase at a fast rate, and it is reasonable to expect an even greater acceleration in the future. As with the first HPSNO conference, the goal of the HPSN097 conference was to supply a broad overview of the more recent developments and trends in nonlinear optimization, emphasizing the algorithmic and high performance software aspects. Bringing together new computational methodologies with theoretical ad vances and new computer technologies is an exciting challenge that involves all scientists willing to develop high performance numerical software. This book contains several important contributions from different and com plementary standpoints. Obviously, the articles in the book do not cover all the areas of the conference topic or all the most recent developments, because of the large number of new theoretical and computational ideas of the last few years."

Progress in Optimization - Contributions from Australasia (Paperback, Softcover reprint of the original 1st ed. 1999): Andrew... Progress in Optimization - Contributions from Australasia (Paperback, Softcover reprint of the original 1st ed. 1999)
Andrew Eberhard, Robin Hill, Daniel Ralph, Barney M. Glover
R2,973 Discovery Miles 29 730 Ships in 10 - 15 working days

Although the monograph Progress in Optimization I: Contributions from Aus tralasia grew from the idea of publishing a proceedings of the Fourth Optimiza tion Day, held in July 1997 at the Royal Melbourne Institute of Technology, the focus soon changed to a refereed volume in optimization. The intention is to publish a similar book annually, following each Optimization Day. The idea of having an annual Optimization Day was conceived by Barney Glover; the first of these Optimization Days was held in 1994 at the University of Ballarat. Barney hoped that such a yearly event would bring together the many, but widely dispersed, researchers in Australia who were publishing in optimization and related areas such as control. The first Optimization Day event was followed by similar conferences at The University of New South Wales (1995), The University of Melbourne (1996), the Royal Melbourne Institute of Technology (1997), and The University of Western Australia (1998). The 1999 conference will return to Ballarat University, being organized by Barney's long-time collaborator Alex Rubinov. In recent years the Optimization Day has been held in conjunction with other locally-held national or international conferences. This has widened the scope of the monograph with contributions not only coming from researchers in Australia and neighboring regions but also from their collaborators in Europe and North America."

New Insights into the Theory of Giffen Goods (Paperback, 2012 ed.): Wim Heijman, Pierre Mouche New Insights into the Theory of Giffen Goods (Paperback, 2012 ed.)
Wim Heijman, Pierre Mouche
R2,922 Discovery Miles 29 220 Ships in 10 - 15 working days

One might expect that after their identification in the 19th century, all aspects of Giffen goods would have been studied by now. This appears not to be the case. This book contains the latest insights into the theory of Giffen goods. In the past, surprisingly few goods could be categorized as "Giffen." This may be because of a lack of understanding of the character of these goods. Therefore, the theories explained in this book may also produce a solid basis for further empirical research in the field. Experts throughout the world have contributed to this book, which predominantly pursues a mathematically rigorous approach. It may be used by researchers in the field of fundamental economics and in graduate-level courses in advanced microeconomics.

Nondifferentiable Optimization and Polynomial Problems (Paperback, Softcover reprint of the original 1st ed. 1998): N. Z. Shor Nondifferentiable Optimization and Polynomial Problems (Paperback, Softcover reprint of the original 1st ed. 1998)
N. Z. Shor
R4,523 Discovery Miles 45 230 Ships in 10 - 15 working days

Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let: e = {: e 1, ...: en} be the vector in n-dimensional real linear space Rn; n PO(: e), PI (: e), ..., Pm (: e) are polynomial functions in R with real coefficients. In general, a PEP can be formulated in the following form: (0.1) find r = inf Po(: e) subject to constraints (0.2) Pi (: e) =0, i=l, ..., m (a constraint in the form of inequality can be written in the form of equality by introducing a new variable: for example, P( x) 0 is equivalent to P(: e) + y2 = 0). Boolean and mixed polynomial problems can be written in usual form by adding for each boolean variable z the equality: Z2 - Z = O. Let a = {al, ..., a } be integer vector with nonnegative entries {a;}f=l. n Denote by R a](: e) monomial in n variables of the form: n R a](: e) = IT: ef';;=1 d(a) = 2:7=1 ai is the total degree of monomial R a]. Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(: e) = L caR a](: e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P

Advances in Nonlinear Programming - Proceedings of the 96 International Conference on Nonlinear Programming (Paperback,... Advances in Nonlinear Programming - Proceedings of the 96 International Conference on Nonlinear Programming (Paperback, Softcover reprint of the original 1st ed. 1998)
Ya-xiang Yuan
R2,987 Discovery Miles 29 870 Ships in 10 - 15 working days

About 60 scientists and students attended the 96' International Conference on Nonlinear Programming, which was held September 2-5 at Institute of Compu tational Mathematics and Scientific/Engineering Computing (ICMSEC), Chi nese Academy of Sciences, Beijing, China. 25 participants were from outside China and 35 from China. The conference was to celebrate the 60's birthday of Professor M.J.D. Powell (Fellow of Royal Society, University of Cambridge) for his many contributions to nonlinear optimization. On behalf of the Chinese Academy of Sciences, vice president Professor Zhi hong Xu attended the opening ceremony of the conference to express his warm welcome to all the participants. After the opening ceremony, Professor M.J.D. Powell gave the keynote lecture "The use of band matrices for second derivative approximations in trust region methods." 13 other invited lectures on recent advances of nonlinear programming were given during the four day meeting: "Primal-dual methods for nonconvex optimization" by M. H. Wright (SIAM President, Bell Labs), "Interior point trajectories in semidefinite programming" by D. Goldfarb (Columbia University, Editor-in-Chief for Series A of Mathe matical Programming), "An approach to derivative free optimization" by A."

Differentiable Optimization and Equation Solving - A Treatise on Algorithmic Science and the Karmarkar Revolution (Paperback,... Differentiable Optimization and Equation Solving - A Treatise on Algorithmic Science and the Karmarkar Revolution (Paperback, Softcover reprint of the original 1st ed. 2003)
John L. Nazareth
R2,951 Discovery Miles 29 510 Ships in 10 - 15 working days

In 1984, N. Karmarkar published a seminal paper on algorithmic linear programming. During the subsequent decade, it stimulated a huge outpouring of new algorithmic results by researchers world-wide in many areas of mathematical programming and numerical computation. This book gives an overview of the resulting, dramatic reorganization that has occurred in one of these areas: algorithmic differentiable optimization and equation-solving, or, more simply, algorithmic differentiable programming. The book is aimed at readers familiar with advanced calculus, numerical analysis, in particular numerical linear algebra, the theory and algorithms of linear and nonlinear programming, and the fundamentals of computer science, in particular, computer programming and the basic models of computation and complexity theory. J.L. Nazareth is a Professor in the Department of Pure and Applied Mathematics at Washington State University. He is the author of two books previously published by Springer-Verlag, DLP and Extensions: An Optimization Model and Decision Support System (2001) and The Newton-Cauchy Framework: A Unified Approach to Unconstrained Nonlinear Minimization (1994).

Handbook of Financial Engineering (Paperback, 2008): Constantin Zopounidis, Michael Doumpos, Panos M. Pardalos Handbook of Financial Engineering (Paperback, 2008)
Constantin Zopounidis, Michael Doumpos, Panos M. Pardalos
R5,826 Discovery Miles 58 260 Ships in 10 - 15 working days

Over the past decade the financial and business environments have undergone significant changes. During the same period several advances have been made within the field of financial engineering, involving both the methodological tools as well as the application areas.

This comprehensive edited volume discusses the most recent advances within the field of financial engineering, focusing not only on the description of the existing areas in financial engineering research, but also on the new methodologies that have been developed for modeling and addressing financial engineering problems.

This book is divided into four major parts, each covering different aspects of financial engineering and modeling such as portfolio management and trading, risk management, applications of operation research methods, and credit rating models.

Handbook of Financial Engineering is intended for financial engineers, researchers, applied mathematicians, and graduate students interested in real-world applications to financial engineering.

Parallel Computing in Optimization (Paperback, Softcover reprint of the original 1st ed. 1997): A. Migdalas, Panos M. Pardalos,... Parallel Computing in Optimization (Paperback, Softcover reprint of the original 1st ed. 1997)
A. Migdalas, Panos M. Pardalos, Sverre Storoy
R8,667 Discovery Miles 86 670 Ships in 10 - 15 working days

During the last three decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, parallel computing has made it possible to solve larger and computationally more difficult prob lems. This volume contains mainly lecture notes from a Nordic Summer School held at the Linkoping Institute of Technology, Sweden in August 1995. In order to make the book more complete, a few authors were invited to contribute chapters that were not part of the course on this first occasion. The purpose of this Nordic course in advanced studies was three-fold. One goal was to introduce the students to the new achievements in a new and very active field, bring them close to world leading researchers, and strengthen their competence in an area with internationally explosive rate of growth. A second goal was to strengthen the bonds between students from different Nordic countries, and to encourage collaboration and joint research ventures over the borders. In this respect, the course built further on the achievements of the "Nordic Network in Mathematical Programming," which has been running during the last three years with the support ofthe Nordic Council for Advanced Studies (NorFA). The final goal was to produce literature on the particular subject, which would be available to both the participating students and to the students of the "next generation" ."

Generalized Convexity, Generalized Monotonicity: Recent Results - Recent Results (Paperback, Softcover reprint of the original... Generalized Convexity, Generalized Monotonicity: Recent Results - Recent Results (Paperback, Softcover reprint of the original 1st ed. 1998)
Jean-Pierre Crouzeix, Juan-Enrique Martinez-Legaz, Michel Volle
R5,827 Discovery Miles 58 270 Ships in 10 - 15 working days

A function is convex if its epigraph is convex. This geometrical structure has very strong implications in terms of continuity and differentiability. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Here again, the geo metrical structure of the level sets implies some continuity and differentiability properties for quasiconvex functions. Optimality conditions and duality can be derived for optimization problems involving such functions as well. Over a period of about fifty years, quasiconvex and other generalized convex functions have been considered in a variety of fields including economies, man agement science, engineering, probability and applied sciences in accordance with the need of particular applications. During the last twenty-five years, an increase of research activities in this field has been witnessed. More recently generalized monotonicity of maps has been studied. It relates to generalized convexity off unctions as monotonicity relates to convexity. Generalized monotonicity plays a role in variational inequality problems, complementarity problems and more generally, in equilibrium prob lems."

Advances in Optimization and Approximation (Paperback, Softcover reprint of the original 1st ed. 1994): Dingzhu Du, Jie Sun Advances in Optimization and Approximation (Paperback, Softcover reprint of the original 1st ed. 1994)
Dingzhu Du, Jie Sun
R4,526 Discovery Miles 45 260 Ships in 10 - 15 working days

2. The Algorithm ...59 3. Convergence Analysis ..., ...60 4. Complexity Analysis ...63 5. Conclusions ...67 References ...67 A Simple Proof for a Result of Ollerenshaw on Steiner Trees ...68 Xiufeng Du, Ding-Zhu Du, Biao Gao, and Lixue Qii 1. Introduction ...68 2. In the Euclidean Plane ...69 3. In the Rectilinear Plane ...70 4. Discussion ...-...71 References ...71 Optimization Algorithms for the Satisfiability (SAT) Problem ...72 Jun Gu 1. Introduction ...72 2. A Classification of SAT Algorithms ...7:3 3. Preliminaries ...IV 4. Complete Algorithms and Incomplete Algorithms ...81 5. Optimization: An Iterative Refinement Process ...86 6. Local Search Algorithms for SAT ...89 7. Global Optimization Algorithms for SAT Problem ...106 8. Applications ...137 9. Future Work ...140 10. Conclusions ...141 References ...143 Ergodic Convergence in Proximal Point Algorithms with Bregman Functions ...155 Osman Guier 1. Introduction ...: ...155 2. Convergence for Function Minimization ...158 3. Convergence for Arbitrary Maximal Monotone Operators ...161 References ...163 Adding and Deleting Constraints in the Logarithmic Barrier Method for LP ...166 D. den Hertog, C. Roos, and T. Terlaky 1. Introduction ...16(5 2. The Logarithmic Darrier Method ...lG8 CONTENTS IX 3. The Effects of Shifting, Adding and Deleting Constraints ...171 4. The Build-Up and Down Algorithm ...177 ...5. Complexity Analysis ...180 References ...184 A Projection Method for Solving Infinite Systems of Linear Inequalities ...186 Hui Hu 1. Introduction ...186 2. The Projection Method ...186 3. Convergence Rate ...189 4. Infinite Systems of Convex Inequalities ...191 5. Application ...193 References ...

Quasiconvex Optimization and Location Theory (Paperback, Softcover reprint of the original 1st ed. 1998): J. a. Dos Santos... Quasiconvex Optimization and Location Theory (Paperback, Softcover reprint of the original 1st ed. 1998)
J. a. Dos Santos Gromicho
R2,945 Discovery Miles 29 450 Ships in 10 - 15 working days

grams of which the objective is given by the ratio of a convex by a positive (over a convex domain) concave function. As observed by Sniedovich (Ref. [102, 103]) most of the properties of fractional pro grams could be found in other programs, given that the objective function could be written as a particular composition of functions. He called this new field C programming, standing for composite concave programming. In his seminal book on dynamic programming (Ref. [104]), Sniedovich shows how the study of such com positions can help tackling non-separable dynamic programs that otherwise would defeat solution. Barros and Frenk (Ref. [9]) developed a cutting plane algorithm capable of optimizing C-programs. More recently, this algorithm has been used by Carrizosa and Plastria to solve a global optimization problem in facility location (Ref. [16]). The distinction between global optimization problems (Ref. [54]) and generalized convex problems can sometimes be hard to establish. That is exactly the reason why so much effort has been placed into finding an exhaustive classification of the different weak forms of convexity, establishing a new definition just to satisfy some desirable property in the most general way possible. This book does not aim at all the subtleties of the different generalizations of convexity, but concentrates on the most general of them all, quasiconvex programming. Chapter 5 shows clearly where the real difficulties appear.

Interior Point Methods of Mathematical Programming (Paperback, Softcover reprint of the original 1st ed. 1996): Tamas Terlaky Interior Point Methods of Mathematical Programming (Paperback, Softcover reprint of the original 1st ed. 1996)
Tamas Terlaky
R8,648 Discovery Miles 86 480 Ships in 10 - 15 working days

One has to make everything as simple as possible but, never more simple. Albert Einstein Discovery consists of seeing what every body has seen and thinking what nobody has thought. Albert S. ent_Gyorgy; The primary goal of this book is to provide an introduction to the theory of Interior Point Methods (IPMs) in Mathematical Programming. At the same time, we try to present a quick overview of the impact of extensions of IPMs on smooth nonlinear optimization and to demonstrate the potential of IPMs for solving difficult practical problems. The Simplex Method has dominated the theory and practice of mathematical pro gramming since 1947 when Dantzig discovered it. In the fifties and sixties several attempts were made to develop alternative solution methods. At that time the prin cipal base of interior point methods was also developed, for example in the work of Frisch (1955), Caroll (1961), Huard (1967), Fiacco and McCormick (1968) and Dikin (1967). In 1972 Klee and Minty made explicit that in the worst case some variants of the simplex method may require an exponential amount of work to solve Linear Programming (LP) problems. This was at the time when complexity theory became a topic of great interest. People started to classify mathematical programming prob lems as efficiently (in polynomial time) solvable and as difficult (NP-hard) problems. For a while it remained open whether LP was solvable in polynomial time or not. The break-through resolution ofthis problem was obtained by Khachijan (1989)."

Progress in Optimization - Contributions from Australasia (Paperback, Softcover reprint of the original 1st ed. 2000): Xiao-qi... Progress in Optimization - Contributions from Australasia (Paperback, Softcover reprint of the original 1st ed. 2000)
Xiao-qi Yang, Alistair I. Mees, Mike Fisher, Les Jennings
R2,986 Discovery Miles 29 860 Ships in 10 - 15 working days

'Optimization Day' (OD) has been a series of annual mini-conferences in Aus tralia since 1994. The purpose of this series of events is to gather researchers in optimization and its related areas from Australia and their collaborators, in order to exchange new developments of optimization theories, methods and their applications. The first four OD mini-conferences were held in The Uni versity of Ballarat (1994), The University of New South Wales (1995), The University of Melbourne (1996) and Royal Melbourne Institute of Technology (1997), respectively. They were all on the eastern coast of Australia. The fifth mini-conference Optimization Days was held at the Centre for Ap plied Dynamics and Optimization (CADO), Department of Mathematics and Statistics, The University of Western Australia, Perth, from 29 to 30 June 1998. This is the first time the OD mini-conference has been held at the west ern coast of Australia. This fifth OD preceded the International Conference on Optimization: Techniques and Applications (ICOTA) held at Curtin Uni versity of Technology. Many participants attended both events. There were 28 participants in this year's mini-conference and 22 presentations in the mini conference. The presentations in this volume are refereed contributions based on papers presented at the fifth Optimization Days mini-conference. The volume is di vided into the following parts: Global Optimization, Nonsmooth Optimization, Optimization Methods and Applications."

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Introduction to the Theory of…
Samia Challal Paperback R1,473 Discovery Miles 14 730
Optimization Modelling Using R
Timothy R. Anderson Hardcover R2,598 Discovery Miles 25 980
The Theory of Composites
Graeme W. Milton Paperback R2,850 Discovery Miles 28 500
Optimality Conditions in Convex…
Anulekha Dhara, Joydeep Dutta Hardcover R5,971 Discovery Miles 59 710
The Less Is More Linear Algebra of…
Daniela Calvetti, Erkki Somersalo Paperback R1,866 Discovery Miles 18 660
Handbook of Moth-Flame Optimization…
Seyed Ali Mirjalili Hardcover R3,114 Discovery Miles 31 140
The Sequential Quadratic Hamiltonian…
Alfio Borzi Hardcover R4,732 Discovery Miles 47 320
Examples and Problems in Advanced…
Bijan Davvaz Hardcover R1,508 Discovery Miles 15 080
Applications of Advanced Optimization…
Abhinav Goel, Anand Chauhan, … Hardcover R4,435 R3,670 Discovery Miles 36 700
Advanced Optimization and…
Anindya Ghosh, Prithwiraj Mal, … Hardcover R5,334 Discovery Miles 53 340

 

Partners