Approximation algorithms for discrete polynomial optimization
DOI10.1007/S40305-013-0003-1zbMATH Open1281.90026OpenAlexW2163718799MaRDI QIDQ384206FDOQ384206
Authors: Simai He, Zhening Li, Shuzhong Zhang 
Publication date: 27 November 2013
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-013-0003-1
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
approximation algorithmmixed integer programmingpolynomial optimization problemapproximation ratiobinary integer programming
Approximation methods and heuristics in mathematical programming (90C59) Multilinear algebra, tensor calculus (15A69) Nonconvex programming, global optimization (90C26) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Maximum block improvement and polynomial optimization
- Title not available (Why is that?)
- Approximating the Cut-Norm via Grothendieck's Inequality
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Semidefinite relaxation and nonconvex quadratic optimization
- Neural networks, error-correcting codes, and polynomials over the binary n-cube
- Title not available (Why is that?)
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- ``Neural computation of decisions in optimization problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
- Title not available (Why is that?)
- Quick approximation to matrices and applications
- Faster algorithms for Frobenius numbers
- Spectral methods for matrices and tensors
- Random sampling and approximation of MAX-CSP problems
- Methods of Nonlinear 0-1 Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Languages and Programming
- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- A Selection Problem of Shared Fixed Costs and Network Flows
- Notes—On a Selection Problem
- Approximation algorithms for indefinite complex quadratic maximization problems
Cited In (17)
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Approximation methods for complex polynomial optimization
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
- Approximation Methods for Polynomial Optimization
- On the consistent path problem
- On norm compression inequalities for partitioned block tensors
- Title not available (Why is that?)
- On the tensor spectral \(p\)-norm and its dual norm via partitions
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Master-slave strategy and polynomial approximation
- Probability bounds for polynomial functions in random variables
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)
