Approximation algorithms for discrete polynomial optimization
From MaRDI portal
Publication:384206
DOI10.1007/s40305-013-0003-1zbMath1281.90026MaRDI QIDQ384206
Zhening Li, Simai He, Shu-Zhong 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
approximation algorithm; mixed integer programming; polynomial optimization problem; approximation ratio; binary integer programming
90C10: Integer programming
90C11: Mixed integer programming
90C26: Nonconvex programming, global optimization
90C59: Approximation methods and heuristics in mathematical programming
15A69: Multilinear algebra, tensor calculus
Related Items
On the Consistent Path Problem, Probability Bounds for Polynomial Functions in Random Variables, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems, Approximation algorithms for optimization of real-valued general conjugate complex forms, Approximation methods for complex polynomial optimization, On norm compression inequalities for partitioned block tensors, On the tensor spectral \(p\)-norm and its dual norm via partitions, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Approximation algorithms for indefinite complex quadratic maximization problems
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- ``Neural computation of decisions in optimization problems
- Quick approximation to matrices and applications
- Faster algorithms for Frobenius numbers
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Spectral methods for matrices and tensors
- Maximum Block Improvement and Polynomial Optimization
- Random sampling and approximation of MAX-CSP problems
- Methods of Nonlinear 0-1 Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Neural networks, error-correcting codes, and polynomials over the binary n-cube
- Automata, Languages and Programming
- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- Approximating the Cut-Norm via Grothendieck's Inequality
- A Selection Problem of Shared Fixed Costs and Network Flows
- Notes—On a Selection Problem
