Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
From MaRDI portal
Publication:1024827
DOI10.1007/s10898-008-9287-9zbMath1173.90503OpenAlexW4235025507MaRDI QIDQ1024827
Christodoulos A. Floudas, Chrysanthos E. Gounaris
Publication date: 17 June 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9287-9
Related Items
A review of recent advances in global optimization, Exact and approximate results for convex envelopes of special structured functions over simplices, Sequence of polyhedral relaxations for nonlinear univariate functions, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Convex relaxation for solving posynomial programs, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Combination of two underestimators for univariate global optimization, The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, A new algorithm for box-constrained global optimization, Convex underestimators of polynomials, On convex relaxations of quadrilinear terms, Convergence rate of McCormick relaxations, Piecewise-linear approximations of multidimensional functions, Convex envelope of bivariate cubic functions over rectangular regions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Approximated perspective relaxations: a project and lift approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Global minimum potential energy conformations of small molecules
- Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
- Convex extensions and envelopes of lower semi-continuous functions
- Convex envelopes of monomials of odd degree
- New interval analysis support functions using gradient information in a global minimization algorithm
- Stochastic adaptive search for global optimization.
- 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
- 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
- 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
- Filled functions for unconstrained global optimization.
- Semidefinite relaxations of fractional programs via novel convexification techniques
