Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for non-convex quadratic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex underestimators of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer nonlinear programming tools: a practical overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer nonlinear programming tools: an updated practical overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class of global minimum bounds of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank

Revision as of 17:34, 13 July 2024

scientific article
Language Label Description Also known as
English
Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
scientific article

    Statements

    Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (English)
    0 references
    0 references
    0 references
    28 April 2017
    0 references
    polynomial optimization
    0 references
    mixed-integer nonlinear programming
    0 references
    separable underestimators
    0 references

    Identifiers