Degree reduction techniques for polynomial optimization problems
From MaRDI portal
Cites work
- A Gray code for combinations of a multiset
- A dynamic inequality generation scheme for polynomial programming
- A new linearization method for generalized linear multiplicative programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Alternative SDP and SOCP approximations for polynomial optimization
- An approximate approach of global optimization for polynomial programming problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Completely positive reformulations of polynomial optimization problems with linear constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Efficient linear reformulations for binary polynomial optimization problems
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Global optimization with polynomials and the problem of moments
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- On linear programming relaxations for solving polynomial programming problems
- Polynomial optimization for water networks: global solutions for the valve setting problem
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
This page was built for publication: Degree reduction techniques for polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982083)
