A spline smoothing Newton method for finite minimax problems

DOI10.1007/S10665-014-9733-2MaRDI QIDQ525261zbMATH OpenOpenAlexFDO

Authors Li Dong, Bo Yu

Publication date 28 April 2017

Published in Journal of Engineering Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10665-014-9733-2

zbMATH Keywords

cubic splinesmoothing techniquefinite minimax problemstabilized Newton method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical computation using splines (65D07) Minimax problems in mathematical programming (90C47) Newton-type methods (49M15)

Recommendations

• A spline smoothing Newton method for semi-infinite minimax problems
• Smoothing method for minimax problems
• A smoothing trust-region Newton-CG method for minimax problem
• A smoothing trust-region Newton-CG method for minimax problems
• Inexact smoothing method for large scale minimax optimization

Cites work

• scientific article; zbMATH DE number 3133812 (Why is no real title available?)
• scientific article; zbMATH DE number 3930735 (Why is no real title available?)
• scientific article; zbMATH DE number 53685 (Why is no real title available?)
• scientific article; zbMATH DE number 193993 (Why is no real title available?)
• scientific article; zbMATH DE number 1736456 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere
• A smoothing-out technique for min—max optimization
• A spline smoothing homotopy method for nonconvex nonlinear programming
• A truncated aggregate smoothing Newton method for minimax problems
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
• Algorithms with adaptive smoothing for finite minimax problems
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
• An algorithm for composite nonsmooth optimization problems
• Fitting parametric curves and surfaces by \(l_\infty\) distance regression
• Generalized Bundle Methods
• Methods of descent for nondifferentiable optimization
• Nondifferential optimization via adaptive smoothing
• Numerical Optimization
• Optimization. Algorithms and consistent approximations
• Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems
• Smooth Optimization Methods for Minimax Problems
• Smoothing method for minimax problems
• Uniform approximation of min/max functions by smooth splines

Cited in

(9)

• A smoothing trust-region Newton-CG method for minimax problem
• Uniform approximation of min/max functions by smooth splines
• A spline smoothing Newton method for semi-infinite minimax problems
• Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing
• Active set smoothing max function based on quadratic polynomial and its application to unconstrained minimax problems
• An aggregate homotopy method for solving unconstrained minimax problems
• An active set smoothing method for solving unconstrained minimax problems
• On nonlinear minimization problems and Lf-splines. I
• A truncated aggregate smoothing Newton method for minimax problems

This page was built for publication: A spline smoothing Newton method for finite minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525261)