Recursive approximation of the high dimensional max function

Authors:
Ş. İ. Birbil;S. -C. Fang;J. B. G. Frenk;S. Zhang
Affiliations:
Faculty of Engineering and Natural Sciences, Sabancı University, Orhanli-Tuzla, 34956, Istanbul, Turkey;Industrial Engineering and Operations Research, North Carolina State University, Raleigh, NC 27695-7906, USA;Econometrics Institute, Erasmus University Rotterdam, Postbus 1738, 3000 DR Rotterdam, The Netherlands;Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China
Venue:
Operations Research Letters
Year:
2005

Citing 5
Cited 2

A smoothing technique for nondifferentiable optimization problems

Proceedings of the international seminar on Optimization
A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations

SIAM Journal on Control and Optimization
Smoothing methods for convex inequalities and linear complementarity problems

Mathematical Programming: Series A and B
Smoothing functions and smoothing Newton method for complementarity and variational inequality problems

Journal of Optimization Theory and Applications
Smoothing Method for Minimax Problems

Computational Optimization and Applications

Data aggregated maximum lifetime routing for wireless sensor networks

Ad Hoc Networks
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a smoothing method for the general n-dimensional max function, based on a recursive extension of smoothing functions for the two-dimensional max function. A theoretical framework is introduced, and some applications are discussed. Finally, a numerical comparison with a well-known smoothing method is presented.