A Spline Smoothing Newton Method for Semi-Infinite Minimax Problems
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 c...
Saved in:
| Main Authors: | Li Dong, Bo Yu, Yu Xiao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/852074 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Nonsmooth Semi-Infinite Minimax Programming Problem with (Φ,ρ)-Invexity
by: X. L. Liu, et al.
Published: (2014-01-01) -
A Smoothing Inexact Newton Method for Nonlinear Complementarity Problems
by: Zhong Wan, et al.
Published: (2015-01-01) -
A general cubic spline smooth semi-supervised support vector machine
by: ZHANG Xiao-dan, et al.
Published: (2015-03-01) -
Semi-Implicit Continuous Newton Method for Power Flow Analysis
by: Ruizhi Yu, et al.
Published: (2025-01-01) -
ON THE STRUCTURE OF THE SINGULAR SET OF A PIECEWISE SMOOTH MINIMAX SOLUTION OF THE HAMILTON–JACOBI–BELLMAN EQUATION
by: Aleksei S. Rodin
Published: (2016-08-01)