Hyperbolic smoothing function method for minimax problems
- 1 June 2013
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 62 (6) , 759-782
Abstract
In this article, an approach for solving finite minimax problems is proposed. This approach is based on the use of hyperbolic smoothing functions. In order to apply the hyperbolic smoothing we reformulate the objective function in the minimax problem and study the relationship between the original minimax and reformulated problems. We also study main properties of the hyperbolic smoothing function. Based on these results an algorithm for solving the finite minimax problem is proposed and this algorithm is implemented in general algebraic modelling system. We present preliminary results of numerical experiments with well-known nonsmooth optimization test problems. We also compare the proposed algorithm with the algorithm that uses the exponential smoothing function as well as with the algorithm based on nonlinear programming reformulation of the finite minimax problem.Keywords
This publication has 16 references indexed in Scilit:
- A truncated aggregate smoothing Newton method for minimax problemsApplied Mathematics and Computation, 2010
- The hyperbolic smoothing clustering methodPattern Recognition, 2010
- A quasisecant method for minimizing nonsmooth functionsOptimization Methods and Software, 2010
- A smoothing algorithm for finite min–max–min problemsOptimization Letters, 2008
- A smoothing trust-region Newton-CG method for minimax problemApplied Mathematics and Computation, 2008
- An Algorithm Based on Active Sets and Smoothing for Discretized Semi-Infinite Minimax ProblemsJournal of Optimization Theory and Applications, 2008
- Discrete Gradient Method: Derivative-Free Method for Nonsmooth OptimizationJournal of Optimization Theory and Applications, 2007
- Algorithms with Adaptive Smoothing for Finite Minimax ProblemsJournal of Optimization Theory and Applications, 2003
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- A smoothing-out technique for min—max optimizationMathematical Programming, 1980