Pages that link to "Item:Q1955542"
From MaRDI portal
The following pages link to Convex underestimators of polynomials (Q1955542):
Displaying 14 items.
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Trigonometric convex underestimator for the base functions in Fourier space (Q1777592) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems (Q2286914) (← links)
- Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
- Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem (Q2416572) (← links)
- Convex kernel underestimation of functions with multiple local minima (Q2506188) (← links)
- (Q3496445) (← links)
- Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
- A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
