More Virtuous Smoothing

DOI10.1137/18M1172831zbMath1411.90282arXiv1802.09112OpenAlexW2963682460MaRDI QIDQ4634104

Jon Lee, Luze Xu, Daphne E. Skipper

Publication date: 7 May 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.09112

zbMATH Keywords

global optimizationsmoothingpiecewisemixed-integer nonlinear optimizationconcavenondifferentiablespatial branch-and-bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (3)

Gaining or losing perspective ⋮ On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs ⋮ On a new smoothing technique for non-smooth, non-convex optimization

Uses Software

• SCIP
• Ipopt
• ANTIGONE

Cites Work

• On the optimal design of water distribution networks: a practical MINLP approach
• SCIP: solving constraint integer programs
• Virtuous smoothing for global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Branching and bounds tighteningtechniques for non-convex MINLP
• On the Performance of NLP Solvers Within Global MINLP Solvers
• The travelling salesman problem with neighbourhoods: MINLP solution
• An MINLP Solution Method for a Water Network Problem

This page was built for publication: More Virtuous Smoothing