Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
From MaRDI portal
Publication:1024828
DOI10.1007/s10898-008-9288-8zbMath1170.90459OpenAlexW2293000863MaRDI QIDQ1024828
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-9288-8
Related Items
A review of recent advances in global optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Convex relaxation for solving posynomial programs, Convergence analysis of Taylor models and McCormick-Taylor models, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Chebyshev model arithmetic for factorable functions, 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, Efficient Convexification Strategy for Generalized Geometric Programming Problems, Piecewise-linear approximations of multidimensional functions, On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method, Performance of convex underestimators in a branch-and-bound framework, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices, New methods for calculating \(\alpha\)BB-type underestimators, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- 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
- 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
- Convex envelopes for edge-concave functions
- The globally convexized filled functions for 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
- 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
- Jointly Constrained Biconvex Programming
- Testing Unconstrained Optimization Software
- 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
