Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(11 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Bienstock, Daniel / rank
Normal rank
 
Property / author
 
Property / author: Bienstock, Daniel / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GLOBALLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Eigen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloMIQO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QuadProgBB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: quadprogIP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3008300991 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.04604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities from Two Rows of a Simplex Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the split closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Lattice-Free Convex Sets in Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Inequalities for an Infinite Relaxation of Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Sets and Minimal Sublinear Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of quadratic surfaces having fixed intersections with two hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Valid Inequalities for Integer Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-Generating Functions and <i>S</i>-Free Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between intersection cuts and the corner polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficiency of cut-generating functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The split closure of a strictly convex body / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Infinite Group Relaxations of MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the first Chvátal closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of four polyhedral set containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic inequality generation scheme for polynomial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral convexity cuts and negative edge extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a nearest symmetric positive semidefinite matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimal Valid Inequalities for Mixed Integer Conic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the best set of variables in regression analysis using integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying framework for several cutting plane methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cook, Kannan and Schrijver's example revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex envelopes for bivariate functions over polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite exact branch-and-bound algorithms for concave minimization over polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the strength of relaxations of multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split cuts and extended formulations for mixed integer conic quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex envelope formula for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Bodies The Brunn-MinkowskiTheory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection cuts for factorable MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing RLT relaxations via a new class of semidefinite cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and sum decomposition of vertex polyhedral convex envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit convex and concave envelopes through polyhedral subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex extensions and envelopes of lower semi-continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New solution approaches for the maximum-reliability stochastic network interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:20, 23 July 2024

scientific article
Language Label Description Also known as
English
Outer-product-free sets for polynomial optimization and oracle-based cuts
scientific article

    Statements

    Outer-product-free sets for polynomial optimization and oracle-based cuts (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2020
    0 references
    polynomial optimization
    0 references
    intersection cuts
    0 references
    cutting planes
    0 references
    \(S\)-free sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references