Yunchol Jong (10 results)
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 65.94
US$ 79.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Practical Algorithms | for Sum-of-Ratios and Multiplicative Programming Problems | Yunchol Jong (u. a.) | Taschenbuch | Englisch | 2025 | Scholars' Press | EAN 9786208847432 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]v…dm-vsg[dot]de | Anbieter: preigu.
- Softcover
- Print on Demand
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 77.94
Free ShippingShips within U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Softcover
- Print on Demand
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 77.13
US$ 4.34 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 77.12
US$ 26.13 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The SoR (Sum-of-Ratios) problem intended to minimize (maximize) a sum of several fractional functions in convex set is a non-convex optimization problem that is difficult to solve by traditional optimization methods. The CMP (Convex… Multiplicative Programming) problem is to minimize the sum of products of two convex functions in convex set. The SoR and CMP problems arise in many applications such as the communication, robotics, computer graphics, finance, engineering, plant layout design, robust optimization, VLSI chip design, data mining and so on.This book presents new parametric approach to the SoR and CMP problem. Compared with existing methods based on branch-and-bound procedure and other approaches, the idea of new method is to reduce the SoR and CMP problems to parametric convex programming problem having parameters in objective functions. The parametric algorithm is based on Newton-like method for solving a system of nonlinear equations with parameters and it needs to solve convex programming problem in each iteration. This new algorithm has the global linear and local superlinear/quadratic rate of convergence. 128 pp. Englisch.
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
US$ 82.84
US$ 48.79 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. The SoR (Sum-of-Ratios) problem intended to minimize (maximize) a sum of several fractional functions in convex set is a non-convex optimization problem that is difficult to solve by traditional optimization methods. The CMP (Convex Multiplicative Programming) problem is to minimize the sum…of products of two convex functions in convex set. The SoR and CMP problems arise in many applications such as the communication, robotics, computer graphics, finance, engineering, plant layout design, robust optimization, VLSI chip design, data mining and so on.This book presents new parametric approach to the SoR and CMP problem. Compared with existing methods based on branch-and-bound procedure and other approaches, the idea of new method is to reduce the SoR and CMP problems to parametric convex programming problem having parameters in objective functions. The parametric algorithm is based on Newton-like method for solving a system of nonlinear equations with parameters and it needs to solve convex programming problem in each iteration. This new algorithm has the global linear and local superlinear/quadratic rate of convergence. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 136.86
US$ 8.57 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 77.12
US$ 68.17 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 128 pp. Englisch.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 78.04
US$ 69.36 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The SoR (Sum-of-Ratios) problem intended to minimize (maximize) a sum of several fractional functions in convex set is a non-convex optimization problem that is difficult to solve by traditional optimization methods. The CMP (Convex Mult…iplicative Programming) problem is to minimize the sum of products of two convex functions in convex set. The SoR and CMP problems arise in many applications such as the communication, robotics, computer graphics, finance, engineering, plant layout design, robust optimization, VLSI chip design, data mining and so on.This book presents new parametric approach to the SoR and CMP problem. Compared with existing methods based on branch-and-bound procedure and other approaches, the idea of new method is to reduce the SoR and CMP problems to parametric convex programming problem having parameters in objective functions. The parametric algorithm is based on Newton-like method for solving a system of nonlinear equations with parameters and it needs to solve convex programming problem in each iteration. This new algorithm has the global linear and local superlinear/quadratic rate of convergence.
- Softcover
- Print on Demand
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 143.90
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 144.47
US$ 11.30 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
