Global optimization of bounded factorable functions with discontinuities

DOI10.1007/s10898-013-0060-3zbMath1311.90114OpenAlexW1967968566MaRDI QIDQ2442640

Achim Wechsung, Paul I. Barton

Publication date: 1 April 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/103613

zbMATH Keywords

global optimizationnonconvex optimizationconvex relaxationsMcCormick relaxationsdiscontinuous functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods of relaxation type (49M20)

Related Items (9)

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Escaping Unknown Discontinuous Regions in Blackbox Optimization ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ On the minimization of possibly discontinuous functions by means of pointwise approximations ⋮ Extended McCormick relaxation rules for handling empty arguments representing infeasibility ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ Convergence analysis of multivariate McCormick relaxations ⋮ On tightness and anchoring of McCormick and other relaxations

Uses Software

• BARON
• PROFIL/BIAS
• NDA
• PNEW
• libMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of direct searches for discontinuous functions
• Generalized McCormick relaxations
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• On solving discontinuous extremal problems
• PROFIL/BIAS - A fast interval library
• Discontinuous piecewise linear optimization
• Numerical methods for solutions of discontinuous extremal problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• An approach to the solution of discontinuous extremal problems
• A branch-and-reduce approach to global optimization
• Robust analysis and global minimization of a class of discontinuous functions. I
• Optimization of Discontinuous Functions: A Generalized Theory of Differentiation
• McCormick-Based Relaxations of Algorithms
• Optimization and nonsmooth analysis
• Discontinuous Optimization by Smoothing
• Interval Methods for Systems of Equations
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Smoothed Functionals in Stochastic Optimization
• The Minimization of Semicontinuous Functions: Mollifier Subgradients
• Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
• Discontinuous dynamical systems
• Hybrid dynamical systems
• Algorithm 811: NDA
• An Algorithm for Separable Nonconvex Programming Problems

This page was built for publication: Global optimization of bounded factorable functions with discontinuities