Discontinuous Optimization by Smoothing

DOI10.1287/moor.6.1.140zbMath0496.90069OpenAlexW2069582186MaRDI QIDQ3960480

Israel Zang

Publication date: 1981

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.6.1.140

zbMATH Keywords

unconstrained optimizationsmoothingnumerical experimentsnondifferentiable optimizationconvergence propertiestest problemscontinuous approximationstep functiongradient techniquediscontinuous optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (10)

Robust analysis and global minimization of a class of discontinuous functions. I ⋮ A second-order smooth penalty function algorithm for constrained optimization problems ⋮ Discontinuous piecewise linear optimization ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ A smooth penalty function algorithm for network-structured problems ⋮ On the minimization of possibly discontinuous functions by means of pointwise approximations ⋮ Gradient-only approaches to avoid spurious local minima in unconstrained optimization ⋮ Global optimization of bounded factorable functions with discontinuities ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ Discontinuous Robust Mappings are Approximatable

This page was built for publication: Discontinuous Optimization by Smoothing