Pages that link to "Item:Q1371947"

The following pages link to New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947):

Displaying 45 items.

• Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
• A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
• Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
• RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
• DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
• Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
• Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
• Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456) (← links)
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
• Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
• Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
• Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality (Q1037375) (← links)
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
• An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
• Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (Q1361075) (← links)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
• Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
• Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
• Product disaggregation in global optimization and relaxations of rational programs (Q1863895) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• Computation of polytopic invariants for polynomial dynamical systems using linear programming (Q1932703) (← links)
• Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
• Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
• Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
• Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
• Global optimization for sum of generalized fractional functions (Q2479363) (← links)
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
• Computation of parameter stability margins using polynomial programming techniques (Q5491419) (← links)
• Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)