A smoothing trust-region Newton-CG method for minimax problem
From MaRDI portal
Publication:928081
DOI10.1016/j.amc.2007.10.070zbMath1146.65053MaRDI QIDQ928081
Ye Feng, Liu Hongwei, Zhou Shuisheng, Liu Sanyang
Publication date: 11 June 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.10.070
unconstrained optimization; smoothing technique; trust-region method; successive quadratic programming (SQP); finite minimax problems; SQP algorithm; Newton conjugate gradient (CG) method; Newton-CG algorithm
65K05: Numerical mathematical programming methods
90C47: Minimax problems in mathematical programming
90C51: Interior-point methods
Related Items
A nonlinear augmented Lagrangian for constrained minimax problems, On solving large-scale finite minimax problems using exponential smoothing, Uniform approximation of min/max functions by smooth splines, New exact penalty function for solving constrained finite min-max problems, A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities, The optimization technique for solving a class of non-differentiable programming based on neural network method
Uses Software
Cites Work
- Algorithms with adaptive smoothing for finite minimax problems
- Enlarging the region of convergence of Newton's method for constrained optimization
- New minimax algorithm
- Optimization. Algorithms and consistent approximations
- Computational schemes for large-scale problems in extended linear- quadratic programming
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- Variable metric methods for minimizing a class of nondifferentiable functions
- A smoothing-out technique for min—max optimization
- An Efficient Method to Solve the Minimax Problem Directly
- Numerical Optimization
- Linear-Quadratic Programming and Optimal Control
- An Algorithm for Minimax Approximation in the Nonlinear Case
- Unnamed Item
- Unnamed Item
