Extended formulations for convex envelopes (Q486393): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MINLPLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mathematica / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Qhull / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982638837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming / 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: The quickhull algorithm for convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonconvex Quadratic Programming with Box Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex relaxations of quadrilinear terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Library Automation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hyperdeterminant and triangulations of the 4-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convex Envelope of (<i>n</i>–1)-Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of products of convex and component-wise concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes generated from finitely many compact convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / 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: Convex envelopes for edge-concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced RLT representations for nonconvex polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464689 / 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: Semidefinite relaxations of fractional programs via novel convexification techniques / 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: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:14, 9 July 2024

scientific article
Language Label Description Also known as
English
Extended formulations for convex envelopes
scientific article

    Statements

    Extended formulations for convex envelopes (English)
    0 references
    0 references
    0 references
    15 January 2015
    0 references
    0 references
    convex envelope
    0 references
    edge-concave functions
    0 references
    extended formulation
    0 references
    reformulation-linearization-technique
    0 references
    simultaneous convexification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references