Tight convex underestimators for C^2-continuous problems. II: Multivariate functions
From MaRDI portal
Publication:1024828
Recommendations
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- On the functional form of convex underestimators for twice continuously differentiable functions
- Rigorous convex underestimators for general twice-differentiable problems
- A tight upper bound for the expectation of a convex function of a multivariate random variable
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Convex underestimation for posynomial functions of positive variables
- On the tightness of Gaussian concentration for convex functions
- scientific article; zbMATH DE number 2127830
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- The least squares estimator of random variables under convex operators on \(L_{\mathcal{F}}^\infty (\mu)\) space
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Analysis of bounds for multilinear functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Convex envelopes for edge-concave functions
- Convex envelopes of monomials of odd degree
- Convex extensions and envelopes of lower semi-continuous functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
- Filled functions for unconstrained global optimization.
- Finding all solutions of nonlinearly constrained systems of equations
- Frontiers in global optimization
- Global minimum potential energy conformations of small molecules
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 6183015 (Why is no real title available?)
- Introduction to global optimization.
- Jointly Constrained Biconvex Programming
- On the functional form of convex underestimators for twice continuously differentiable functions
- Rigorous convex underestimators for general twice-differentiable problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Stochastic adaptive search for global optimization.
- Testing Unconstrained Optimization Software
- The globally convexized filled functions for global optimization
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Trigonometric convex underestimator for the base functions in Fourier space
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(30)- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Chebyshev model arithmetic for factorable functions
- Safe and tight linear estimators for global optimization
- Trigonometric convex underestimator for the base functions in Fourier space
- Rigorous convex underestimators for general twice-differentiable problems
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- Convex underestimators of polynomials
- On convex relaxations of quadrilinear terms
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- Convex relaxation for solving posynomial programs
- Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Convergence analysis of Taylor models and McCormick-Taylor models
- Combination of two underestimators for univariate global optimization
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- Performance of convex underestimators in a branch-and-bound framework
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- A new algorithm for box-constrained global optimization
- Convergence rate of McCormick relaxations
- Tighter convex underestimator for general twice differentiable function for global optimization
- Constructing tight quadratic relaxations for global optimization. II: underestimating difference-of-convex (D.C.) functions
- Parabolic approximation \& relaxation for MINLP
- Computing approximate Nash equilibria for integer programming games
- Publisher correction to: ``Parabolic approximation \& relaxation for MINLP
- New methods for calculating \(\alpha\)BB-type underestimators
- A review of recent advances in global optimization
- Piecewise-linear approximations of multidimensional functions
This page was built for publication: Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024828)
