An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
type: Item
instance of: scholarly article
title: An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
zbMATH Open document ID: 1422.90038
author: M. M. Faruque Hasan
published in: Journal of Global Optimization
publication date: 2018-08-29T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6928826
zbMATH Keywords: global optimization
zbMATH Keywords: edge-concave underestimator
zbMATH Keywords: relaxation
zbMATH Keywords: nonconvex NLP
describes a project that uses: ANTIGONE
describes a project that uses: GloMIQO
MaRDI profile type: Publication
full work available at URL: s10898-018-0646-x
OpenAlex ID: W2794512178
cites work: Handbook of test problems in local and global optimization
cites work: Deterministic global optimization. Theory, methods and applications
cites work: Introduction to global optimization.
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Frontiers in global optimization
cites work: A review of recent advances in global optimization
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Jointly Constrained Biconvex Programming
cites work: Q4464676
cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
cites work: Analysis of bounds for multilinear functions
cites work: Finding all solutions of nonlinearly constrained systems of equations
cites work: Semidefinite relaxations of fractional programs via novel convexification techniques
cites work: Convex extensions and envelopes of lower semi-continuous functions
cites work: Convex envelopes of monomials of odd degree
cites work: Convex envelopes for edge-concave functions
cites work: On a class of functions attaining their maximum at the vertices of a polyhedron
cites work: Q4464689
cites work: Existence and sum decomposition of vertex polyhedral convex envelopes
cites work: Trigonometric convex underestimator for the base functions in Fourier space
cites work: Global minimum potential energy conformations of small molecules
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Rigorous convex underestimators for general twice-differentiable problems
cites work: A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems
cites work: Q5301184
cites work: On the functional form of convex underestimators for twice continuously differentiable functions
cites work: Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
cites work: Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
cites work: Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
cites work: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
cites work: GLOMIQO: global mixed-integer quadratic optimizer
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
cites work: New methods for calculating \(\alpha\)BB-type underestimators
cites work: Performance of convex underestimators in a branch-and-bound framework
DOI: 10.1007/S10898-018-0646-X
description: scientific article; zbMATH DE number 6928826