A spline smoothing Newton method for finite minimax problems
From MaRDI portal
Publication:525261
DOI10.1007/s10665-014-9733-2zbMath1360.90288OpenAlexW1989277673MaRDI QIDQ525261
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
Numerical computation using splines (65D07) Minimax problems in mathematical programming (90C47) Numerical optimization and variational techniques (65K10) Newton-type methods (49M15)
Related Items
An active set smoothing method for solving unconstrained minimax problems, A spline smoothing Newton method for semi-infinite minimax problems, An aggregate homotopy method for solving unconstrained minimax problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms with adaptive smoothing for finite minimax problems
- Uniform approximation of min/max functions by smooth splines
- A truncated aggregate smoothing Newton method for minimax problems
- Nondifferential optimization via adaptive smoothing
- An algorithm for composite nonsmooth optimization problems
- Optimization. Algorithms and consistent approximations
- Methods of descent for nondifferentiable optimization
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- A spline smoothing homotopy method for nonconvex nonlinear programming
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- Smooth Optimization Methods for Minimax Problems
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A smoothing-out technique for min—max optimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- Numerical Optimization
- Generalized Bundle Methods
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Smoothing method for minimax problems
