Discontinuous Optimization by Smoothing

DOI10.1287/MOOR.6.1.140MaRDI QIDQ3960480zbMATH OpenOpenAlexFDO

Authors 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

continuous approximationconvergence propertiesdiscontinuous optimizationgradient techniquenondifferentiable optimizationnumerical experimentssmoothingstep functiontest problemsunconstrained optimization

Mathematics Subject Classification ID

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

Cited in

(13)

• Discontinuous piecewise linear optimization
• A smooth penalty function algorithm for network-structured problems
• On the minimization of possibly discontinuous functions by means of pointwise approximations
• Mathematical programming formulations for piecewise polynomial functions
• Global optimization of bounded factorable functions with discontinuities
• Robust analysis and global minimization of a class of discontinuous functions. I
• A second-order smooth penalty function algorithm for constrained optimization problems
• Gradient-only approaches to avoid spurious local minima in unconstrained optimization
• Discontinuous Robust Mappings are Approximatable
• Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
• Fast and correct gradient-based optimisation for probabilistic programming via smoothing
• The gradient's limit of a definable family of functions admits a variational stratification
• Score-based discrete decision rules for contextual constrained stochastic programming

This page was built for publication: Discontinuous Optimization by Smoothing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960480)