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