An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
From MaRDI portal
Publication:1668794
DOI10.1007/s10898-018-0646-xzbMath1422.90038OpenAlexW2794512178MaRDI QIDQ1668794
Publication date: 29 August 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0646-x
Related Items (4)
Deterministic global derivative-free optimization of black-box problems with bounded Hessian ⋮ Global dynamic optimization using edge-concave underestimator ⋮ Deterministic global optimization of steam cycles using the IAPWS-IF97 model ⋮ Black-Box Optimization: Methods and Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- New methods for calculating \(\alpha\)BB-type underestimators
- A review of recent advances in global optimization
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- On a class of functions attaining their maximum at the vertices of a polyhedron
- Handbook of test problems in local and global optimization
- Global minimum potential energy conformations of small molecules
- Convex extensions and envelopes of lower semi-continuous functions
- Convex envelopes of monomials of odd degree
- Frontiers in global optimization
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Trigonometric convex underestimator for the base functions in Fourier space
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- Rigorous convex underestimators for general twice-differentiable problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Finding all solutions of nonlinearly constrained systems of equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- Deterministic global optimization. Theory, methods and applications
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- On the functional form of convex underestimators for twice continuously differentiable functions
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Introduction to global optimization.
- Analysis of bounds for multilinear functions
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Performance of convex underestimators in a branch-and-bound framework
This page was built for publication: An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
