Reduced RLT representations for nonconvex polynomial programming problems
From MaRDI portal
Recommendations
- On linear programming relaxations for solving polynomial programming problems
- Global optimization of nonconvex polynomial programming problems having rational exponents
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- scientific article; zbMATH DE number 1857670
- On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology
Cites work
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- A branch-and-reduce approach to global optimization
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Branching and bounds tighteningtechniques for non-convex MINLP
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Dual quadratic estimates in polynomial and Boolean programming
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- Global optimization problems and domain reduction strategies
- Linearity embedded in nonconvex programs
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Cited in
(20)- scientific article; zbMATH DE number 1857670 (Why is no real title available?)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Template polyhedra and bilinear optimization
- Extended formulations for convex envelopes
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- A framework for globally optimizing mixed-integer signomial programs
- GLOMIQO: global mixed-integer quadratic optimizer
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- LP formulations for polynomial optimization problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- On linear programming relaxations for solving polynomial programming problems
- Error bounds for monomial convexification in polynomial optimization
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology
This page was built for publication: Reduced RLT representations for nonconvex polynomial programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427362)
