A Spline Smoothing Newton Method for Semi-Infinite Minimax Problems | Zendy

Li Dong | Zendy; Bo Yu | Zendy; Yu Xiao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Spline Smoothing Newton Method for Semi-Infinite Minimax Problems

Author(s) -

Li Dong,

Bo Yu,

Yu Xiao

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/852074

Subject(s) - minimax , smoothing spline , smoothing , discretization , mathematics , m spline , spline (mechanical) , perfect spline , mathematical optimization , thin plate spline , minimax approximation algorithm , hermite spline , function (biology) , newton's method , mathematical analysis , spline interpolation , nonlinear system , statistics , structural engineering , engineering , evolutionary biology , physics , quantum mechanics , bilinear interpolation , biology

Based on discretization methods for solving semi-infinite programming problems, this paper presents a spline smoothing Newton method for semi-infinite minimax problems. The spline smoothing technique uses a smooth cubic spline instead of max function and only few components in the max function are computed; that is, it introduces an active set technique, so it is more efficient for solving large-scale minimax problems arising from the discretization of semi-infinite minimax problems. Numerical tests show that the new method is very efficient

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research