Pages that link to "Item:Q384206"
From MaRDI portal
The following pages link to Approximation algorithms for discrete polynomial optimization (Q384206):
Displaying 17 items.
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- Master-slave strategy and polynomial approximation (Q1588828) (← links)
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808) (← links)
- On norm compression inequalities for partitioned block tensors (Q2174201) (← links)
- On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations (Q2797107) (← links)
- (Q3059324) (← links)
- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets (Q3066152) (← links)
- On the Consistent Path Problem (Q5144803) (← links)
- Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
- Approximation Methods for Polynomial Optimization (Q5390033) (← links)
- Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
