More Virtuous Smoothing
From MaRDI portal
Abstract: In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate functions that satisfy , is increasing and concave on , is twice differentiable on all of , but is undefined or intolerably large. The canonical examples are root functions , for . We consider the earlier approach of defining a smoothing function that is identical with on , for some chosen , then replacing the part of on with the unique homogeneous cubic, matching , and at . The parameter is used to control (i.e., upper bound) the derivative at 0 (which controls it on all of when is concave). Our main results: (i) we weaken an earlier sufficient condition to give a necessary and sufficient condition for the piecewise function to be increasing and concave; (ii) we give a general sufficient condition for to be decreasing in the smoothing parameter ; under the same condition, we demonstrate that the worst-case error of as an estimate of is increasing in ; (iii) we give a general sufficient condition for to underestimate ; (iv) we give a general sufficient condition for to dominate the simple `shift smoothing' (), when the parameters and are chosen `fairly' --- i.e., so that . In doing so, we solve two natural open problems of Lee and Skipper (2016), concerning (iii) and (iv) for root functions.
Recommendations
Cites work
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An MINLP Solution Method for a Water Network Problem
- Branching and bounds tighteningtechniques for non-convex MINLP
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- On the Performance of NLP Solvers Within Global MINLP Solvers
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the optimal design of water distribution networks: a practical MINLP approach
- SCIP: solving constraint integer programs
- The travelling salesman problem with neighbourhoods: MINLP solution
- Virtuous smoothing for global optimization
Cited in
(6)- On a new smoothing technique for non-smooth, non-convex optimization
- Gaining or losing perspective
- Unscented Rauch--Tung--Striebel Smoother
- Virtuous smoothing for global optimization
- A novel class of exact penalty function approach for optimization problems with inequality constraints
- On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs
This page was built for publication: More Virtuous Smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634104)