Hyperbolic smoothing function method for minimax problems

DOI10.1080/02331934.2012.675335zbMath1282.65065OpenAlexW2074370115MaRDI QIDQ2841156

A. Al Nuaimat, N. Sultanova, Adil M. Bagirov

Publication date: 24 July 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.675335

zbMATH Keywords

nonsmooth optimizationnumerical resultssubdifferentialminimax problemsmoothing techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47)

Related Items

Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ A new smoothing approach to exact penalty functions for inequality constrained optimization problems ⋮ A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ Parameter estimation in models generated by SDEs with symmetric alpha-stable noise ⋮ Smoothing techniques in solving non-Lipschitz absolute value equations ⋮ Hyperbolic regression: a new regression model with applications to the binary classification problem ⋮ A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions ⋮ Robust equilibrium in transportation networks ⋮ New Smoothing Approximations to Piecewise Smooth Functions and Applications ⋮ An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ An algorithm for clusterwise linear regression based on smoothing techniques ⋮ A hyperbolic smoothing approach to the multisource Weber problem ⋮ On a new smoothing technique for non-smooth, non-convex optimization ⋮ Smoothing approximations for piecewise smooth functions: a probabilistic approach ⋮ An incremental clustering algorithm based on hyperbolic smoothing

Cites Work

• Algorithms with adaptive smoothing for finite minimax problems
• Optimal covering of plane domains by circles via hyperbolic smoothing
• A smoothing trust-region Newton-CG method for minimax problem
• An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• A truncated aggregate smoothing Newton method for minimax problems
• A smoothing algorithm for finite min-max-min problems
• Methods of descent for nondifferentiable optimization
• The hyperbolic smoothing clustering method
• A quasisecant method for minimizing nonsmooth functions
• A smoothing-out technique for min—max optimization
• On logarithmic smoothing of the maximum function
• Smoothing method for minimax problems
• Benchmarking optimization software with performance profiles.