Global optimization of bounded factorable functions with discontinuities
From MaRDI portal
Recommendations
- Global optimization of nonconvex factorable programming problems
- Global minimization of constrained problems with discontinuous penalty functions
- A note on adapting methods for continuous global optimization to the discrete case
- Integral global minimization of constrained problems with discontinuous penalty functions
- LP-form inclusion functions for global optimization
Cites work
- A branch-and-reduce approach to global optimization
- Algorithm 811: NDA
- An Algorithm for Separable Nonconvex Programming Problems
- An approach to the solution of discontinuous extremal problems
- Analysis of direct searches for discontinuous functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Discontinuous dynamical systems
- Discontinuous Optimization by Smoothing
- Discontinuous piecewise linear optimization
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Generalized McCormick relaxations
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 1187201 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 646228 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Hybrid dynamical systems
- Interval Methods for Systems of Equations
- McCormick-Based Relaxations of Algorithms
- Numerical methods for solutions of discontinuous extremal problems
- On solving discontinuous extremal problems
- Optimization and nonsmooth analysis
- Optimization of discontinuous functions: A generalized theory of differentiation
- PROFIL/BIAS - A fast interval library
- Robust analysis and global minimization of a class of discontinuous functions. I
- Smoothed Functionals in Stochastic Optimization
- The Minimization of Semicontinuous Functions: Mollifier Subgradients
Cited in
(10)- 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
- Mathematical programming formulations for piecewise polynomial functions
- On tightness and anchoring of McCormick and other relaxations
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Escaping unknown discontinuous regions in blackbox optimization
- Convergence analysis of multivariate McCormick relaxations
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- Comparison of MINLP formulations for global superstructure optimization
- Convergence towards a local minimum by direct search methods with a covering step
This page was built for publication: Global optimization of bounded factorable functions with discontinuities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442640)
