Artículos relacionados a Abstract Convexity and Global Optimization: 44 (Nonconvex...
Abstract Convexity and Global Optimization: 44 (Nonconvex Optimization and Its Applications) - Tapa dura
Sinopsis
Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized derivatives allow us to ac complish a local approximation of a given function in a neighbourhood of a given point. This kind of approximation is very useful in the study of local extrema. However, local approximation alone cannot help to solve many problems of global optimization, so there is a clear need to develop special global tools for solving these problems. The simplest and most well-known area of global and simultaneously local optimization is convex programming. The fundamental tool in the study of convex optimization problems is the subgradient, which actu ally plays both a local and global role. First, a subgradient of a convex function f at a point x carries out a local approximation of f in a neigh bourhood of x. Second, the subgradient permits the construction of an affine function, which does not exceed f over the entire space and coincides with f at x. This affine function h is called a support func tion. Since f(y) ~ h(y) for ally, the second role is global. In contrast to a local approximation, the function h will be called a global affine support.
"Sinopsis" puede pertenecer a otra edición de este libro.
Críticas
'This book, written by one of the leading contributors in the field, is an up-to-date and very valuable reference. It will be precious to any researcher working in the field on theoretical aspects and applications as well. It opens new ways in global optimization.'
Mathematical Reviews (2002i)
'The book will be very useful for experts in optimisation and aspects of functional and numerical analysis and related topics. This is an excellent introduction to those who are interested in the study of abstract convexity and its applications and to very interesting and highly applicable generalisations on convexity.'
Australian Mathematical Society GAZETTE, August (2002)
Reseña del editor
Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized derivatives allow us to ac complish a local approximation of a given function in a neighbourhood of a given point. This kind of approximation is very useful in the study of local extrema. However, local approximation alone cannot help to solve many problems of global optimization, so there is a clear need to develop special global tools for solving these problems. The simplest and most well-known area of global and simultaneously local optimization is convex programming. The fundamental tool in the study of convex optimization problems is the subgradient, which actu ally plays both a local and global role. First, a subgradient of a convex function f at a point x carries out a local approximation of f in a neigh bourhood of x. Second, the subgradient permits the construction of an affine function, which does not exceed f over the entire space and coincides with f at x. This affine function h is called a support func tion. Since f(y) ~ h(y) for ally, the second role is global. In contrast to a local approximation, the function h will be called a global affine support.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 110,52
EUR 21,04 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 136,16
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Abstract Convexity and Global Optimization: 44 (Nonconvex...
Imagen de archivo
Abstract Convexity and Global Optimization (Nonconvex Optimization and Its Applications)
Librería: Abyssbooks, Crestone, CO, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: As New. Near fine with almost no discernible wear. Nº de ref. del artículo: NQ-5N5C-SGUY
Cantidad disponible: 1 disponibles
Imagen del vendedor
Abstract Convexity and Global Optimization
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized de. Nº de ref. del artículo: 5969334
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Abstract Convexity and Global Optimization (Nonconvex Optimization and Its Applications, 44)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780792363231_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Abstract Convexity and Global Optimization
Impresión bajo demandaLibrería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized derivatives allow us to ac complish a local approximation of a given function in a neighbourhood of a given point. This kind of approximation is very useful in the study of local extrema. However, local approximation alone cannot help to solve many problems of global optimization, so there is a clear need to develop special global tools for solving these problems. The simplest and most well-known area of global and simultaneously local optimization is convex programming. The fundamental tool in the study of convex optimization problems is the subgradient, which actu ally plays both a local and global role. First, a subgradient of a convex function f at a point x carries out a local approximation of f in a neigh bourhood of x. Second, the subgradient permits the construction of an affine function, which does not exceed f over the entire space and coincides with f at x. This affine function h is called a support func tion. Since f(y) ~ h(y) for ally, the second role is global. In contrast to a local approximation, the function h will be called a global affine support. 516 pp. Englisch. Nº de ref. del artículo: 9780792363231
Cantidad disponible: 2 disponibles
Imagen de archivo
Abstract Convexity and Global Optimization
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 516. Nº de ref. del artículo: 26296558
Cantidad disponible: 1 disponibles
Imagen del vendedor
Abstract Convexity and Global Optimization
Publicado por
Springer US, Springer US, 2000
ISBN 10: 079236323X
ISBN 13: 9780792363231
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized derivatives allow us to ac complish a local approximation of a given function in a neighbourhood of a given point. This kind of approximation is very useful in the study of local extrema. However, local approximation alone cannot help to solve many problems of global optimization, so there is a clear need to develop special global tools for solving these problems. The simplest and most well-known area of global and simultaneously local optimization is convex programming. The fundamental tool in the study of convex optimization problems is the subgradient, which actu ally plays both a local and global role. First, a subgradient of a convex function f at a point x carries out a local approximation of f in a neigh bourhood of x. Second, the subgradient permits the construction of an affine function, which does not exceed f over the entire space and coincides with f at x. This affine function h is called a support func tion. Since f(y) ~ h(y) for ally, the second role is global. In contrast to a local approximation, the function h will be called a global affine support. Nº de ref. del artículo: 9780792363231
Cantidad disponible: 1 disponibles
Imagen de archivo
Abstract Convexity and Global Optimization
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 516 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Nº de ref. del artículo: 7551409
Cantidad disponible: 1 disponibles
Imagen de archivo
Abstract Convexity and Global Optimization
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 516. Nº de ref. del artículo: 18296548
Cantidad disponible: 1 disponibles
Imagen del vendedor
Abstract Convexity and Global Optimization
Publicado por
Springer US, Springer US Mai 2000, 2000
ISBN 10: 079236323X
ISBN 13: 9780792363231
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Neuware -Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized derivatives allow us to ac complish a local approximation of a given function in a neighbourhood of a given point. This kind of approximation is very useful in the study of local extrema. However, local approximation alone cannot help to solve many problems of global optimization, so there is a clear need to develop special global tools for solving these problems. The simplest and most well-known area of global and simultaneously local optimization is convex programming. The fundamental tool in the study of convex optimization problems is the subgradient, which actu ally plays both a local and global role. First, a subgradient of a convex function f at a point x carries out a local approximation of f in a neigh bourhood of x. Second, the subgradient permits the construction of an affine function, which does not exceed f over the entire space and coincides with f at x. This affine function h is called a support func tion. Since f(y) ~ h(y) for ally, the second role is global. In contrast to a local approximation, the function h will be called a global affine support.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 516 pp. Englisch. Nº de ref. del artículo: 9780792363231
Cantidad disponible: 2 disponibles
Imagen de archivo
Abstract Convexity and Global Optimization (Nonconvex Optimization and Its Applications, 44)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190183684
Cantidad disponible: Más de 20 disponibles