On linear programming relaxations for solving polynomial programming problems
From MaRDI portal
Recommendations
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Reduced RLT representations for nonconvex polynomial programming problems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Linear programming relaxations of quadratically constrained quadratic programs
- scientific article; zbMATH DE number 1985306
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A convex envelope formula for multilinear functions
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new linearization method for generalized linear multiplicative programming
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Analysis of bounds for multilinear functions
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Branching and bounds tighteningtechniques for non-convex MINLP
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Dual quadratic estimates in polynomial and Boolean programming
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Global minimization of a difference of two convex functions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex factorable programming problems
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization with polynomials and the problem of moments
- Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On convex relaxations for quadratically constrained quadratic programming
- On convex relaxations of quadrilinear terms
- Quantifying double McCormick
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Some results on the strength of relaxations of multilinear functions
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(14)- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- scientific article; zbMATH DE number 3843508 (Why is no real title available?)
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- scientific article; zbMATH DE number 3978821 (Why is no real title available?)
- Reduced RLT representations for nonconvex polynomial programming problems
- scientific article; zbMATH DE number 1083133 (Why is no real title available?)
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- scientific article; zbMATH DE number 1379519 (Why is no real title available?)
- Polynomial Programming: LP-Relaxations Also Converge
- Efficient linear reformulations for binary polynomial optimization problems
- Degree reduction techniques for polynomial optimization problems
- Border basis relaxation for polynomial optimization
This page was built for publication: On linear programming relaxations for solving polynomial programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654348)
