Convex optimization mathematical function (4 resultados)

- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 125,55
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Convex Optimization | Mathematical optimization, Convex function, Convex analysis | Eldon A. Mainyu | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786136544830 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 43,04
Envío por EUR 35,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponible
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematical optimization, the Rosenbrock function is a non-convex function used as a performance test problem for optimization algorithms. It is also known as Rosenbrock''s valley or Rosenbrock''s banana function. The global minimum is inside a long, narrow, parabolic shaped flat valley. To find the valley is trivial. To converge to the global minimum, however, is difficult. It is defined by f(x, y) = (1-x)^2 + 100(y-x^2)^2 .quad. It has a global minimum at (x,y) = (1,1) where f(x,y) = 0. A different coefficient of the second term is sometimes given, but this does not affect the position of the global minimum. Two variants are commonly encountered. One is the sum of N / 2 uncoupled 2D Rosenbrock problems, f(x_1, x_2, dots, x_N) = sum_{i=1}^{N/2} left[100(x_{2i-1}^2 - x_{2i})^2 + (x_{2i-1} - 1)^2 right]. This variant is only defined for even N and has predictably simple solutions. A more involved variant is f(x) = sum_{i=1}^{N-1} left[ (1-x_i)^2+ 100 (x_{i+1} - x_i^2 )^2 right] quad forall xinmathbb{R}^N.…

- Tapa blanda
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 110,10
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Rosenbrock Function | Mathematical Optimization, Convex Function, Algorithm, Optimization, Sturm's Theorem | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131256035 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. …

- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 163,74
Envío por EUR 35,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponible
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Convex optimization, a subfield of mathematical optimization, studies the problem of minimizing convex functions. Convex minimization has applications in a wide range of disciplines, such as automatic control systems, estimation and signal processing, communications and networks, electronic circuit design, data analysis and modeling, statistics, and finance. With recent improvements in computing and in optimization theory, convex minimization is nearly as straightforward as linear programming. These results are used by the theory of convex minimization along with geometric notions from functional analysis such as the Hilbert projection theorem, the separating hyperplane theorem, and Farkas' lemma.…