Granularity for mixed-integer polynomial optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3637601 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A feasible rounding approach for mixed-integer optimization problems
- An introduction to polynomial and semi-algebraic optimization
- Convex Analysis
- Feasible rounding approaches for equality constrained mixed-integer optimization problems
- Global optimization with polynomials and the problem of moments
- Granularity in nonlinear mixed-integer optimization
- Julia: a fresh approach to numerical computing
- Mixed-integer nonlinear optimization
- Moment and Polynomial Optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Sparse Polynomial Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Tractable approximations of sets defined with quantifiers
Cited in
(1)
This page was built for publication: Granularity for mixed-integer polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998510)
