menu
{ "item_title" : "Numerical Analysis and Optimization", "item_author" : [" Mehiddin Al-Baali", "Anton Purnama", "Lucio Grandinetti "], "item_description" : "A new inexact nonmonotone filter sequential quadratic programming algorithm (Mahdavi-Amiri et al.).- Behavior of Limited Memory BFGS when Applied to Nonsmooth Functions and their Nesterov Smoothings(Overton et al.).- Subgradient smoothing method for nonsmooth nonconvex optimization(Roos et al.).- On some optimization problems that can be solved in O(n) time(Facchinei et al.).- Iteration complexity of a fixed-stepsize SQP method for nonconvex optimization with convex constraints(Facchinei et al.).- Modelling and Inferring the Triggering Function in a Self-Exciting Point Process(Mahdavi-Amiri et al.).- A new multi-point stepsize gradient method for optimization(Higham et al.).- A Julia implementation of Algorithm NCL for constrained optimization(Dai et al.).- A Survey on Modeling Approaches for Generation and Transmission Expansion Planning Analysis (Vespucci et al.).- Second Order Adjoints in Optimization (Sachs).- Largest Small n-polygons: Numerical Optimum Estimates for n >= 6 (Pint r).- Computational Science in the 17th century. Numerical solution of algebraic equations: digit-by-digit computation (Steihaug).", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/03/072/039/303072039X_b.jpg", "price_data" : { "retail_price" : "109.99", "online_price" : "109.99", "our_price" : "109.99", "club_price" : "109.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Numerical Analysis and Optimization|Mehiddin Al-Baali

Numerical Analysis and Optimization : Nao-V, Muscat, Oman, January 2020

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

A new inexact nonmonotone filter sequential quadratic programming algorithm (Mahdavi-Amiri et al.).- Behavior of Limited Memory BFGS when Applied to Nonsmooth Functions and their Nesterov Smoothings(Overton et al.).- Subgradient smoothing method for nonsmooth nonconvex optimization(Roos et al.).- On some optimization problems that can be solved in O(n) time(Facchinei et al.).- Iteration complexity of a fixed-stepsize SQP method for nonconvex optimization with convex constraints(Facchinei et al.).- Modelling and Inferring the Triggering Function in a Self-Exciting Point Process(Mahdavi-Amiri et al.).- A new multi-point stepsize gradient method for optimization(Higham et al.).- A Julia implementation of Algorithm NCL for constrained optimization(Dai et al.).- A Survey on Modeling Approaches for Generation and Transmission Expansion Planning Analysis (Vespucci et al.).- Second Order Adjoints in Optimization (Sachs).- Largest Small n-polygons: Numerical Optimum Estimates for n >= 6 (Pint r).- Computational Science in the 17th century. Numerical solution of algebraic equations: digit-by-digit computation (Steihaug).

This item is Non-Returnable

Details

  • ISBN-13: 9783030720391
  • ISBN-10: 303072039X
  • Publisher: Springer
  • Publish Date: November 2021
  • Dimensions: 9.21 x 6.14 x 0.75 inches
  • Shipping Weight: 1.36 pounds
  • Page Count: 297

Related Categories

You May Also Like...

    1

BAM Customer Reviews