Analysis of Bounds for Multilinear Functions
Journal of Global Optimization
Convex Envelopes of Monomials of Odd Degree
Journal of Global Optimization
IEEE Computational Science & Engineering
Trilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes
Journal of Global Optimization
Computational Experience with a New Class of Convex Underestimators: Box-constrained NLP Problems
Journal of Global Optimization
Journal of Global Optimization
Convex envelopes for edge-concave functions
Mathematical Programming: Series A and B
Journal of Global Optimization
Tight convex underestimators for $${{\mathcal C}^2}$$-continuous problems: I. univariate functions
Journal of Global Optimization
An Efficient Global Approach for Posynomial Geometric Programming Problems
INFORMS Journal on Computing
Hi-index | 0.00 |
A polynomial optimization problem whose objective function is represented as a sum of positive and even powers of polynomials, called a polynomial least squares problem, is considered. Methods to transform a polynomial least square problem to polynomial ...