Approximation algorithms for discrete polynomial optimization
From MaRDI portal
Recommendations
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Approximation methods for complex polynomial optimization
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Approximation Methods for Polynomial Optimization
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
Cites work
- scientific article; zbMATH DE number 1187159 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302192 (Why is no real title available?)
- scientific article; zbMATH DE number 977103 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- A Selection Problem of Shared Fixed Costs and Network Flows
- Approximating the Cut-Norm via Grothendieck's Inequality
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Approximation algorithms for indefinite complex quadratic maximization problems
- Automata, Languages and Programming
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Faster algorithms for Frobenius numbers
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximum block improvement and polynomial optimization
- Methods of Nonlinear 0-1 Programming
- Neural networks, error-correcting codes, and polynomials over the binary n-cube
- Notes—On a Selection Problem
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Quick approximation to matrices and applications
- Random sampling and approximation of MAX-CSP problems
- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- Semidefinite relaxation and nonconvex quadratic optimization
- Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
- Spectral methods for matrices and tensors
- ``Neural computation of decisions in optimization problems
Cited in
(17)- Master-slave strategy and polynomial approximation
- scientific article; zbMATH DE number 5823944 (Why is no real title available?)
- Probability bounds for polynomial functions in random variables
- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets
- Approximation Methods for Polynomial Optimization
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- On the consistent path problem
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
- On norm compression inequalities for partitioned block tensors
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Approximation methods for complex polynomial optimization
This page was built for publication: Approximation algorithms for discrete polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384206)
