Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex problems with multilinear intermediates / 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: On the Relation Between Option and Stock Prices: A Convex Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second‐Order Cone Programming Relaxation of Sensor Network Localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Bernstein expansion to the solution of control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio selection with higher moments / 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: Relaxations of factorable functions with convex-transformable intermediates / 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: Q4464676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: GLOMIQO: global mixed-integer quadratic optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / 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: A new reformulation-linearization technique for bilinear 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: A reformulation-convexification approach for solving nonconvex quadratic programming problems / 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: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex factorable programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semidefinite programming for sensor network localization / 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: 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
Property / cites work
 
Property / cites work: Global optimization of general non-convex problems with intermediate bilinear substructures / rank
 
Normal rank

Latest revision as of 18:05, 8 July 2024

scientific article
Language Label Description Also known as
English
Global optimization of general nonconvex problems with intermediate polynomial substructures
scientific article

    Statements

    Global optimization of general nonconvex problems with intermediate polynomial substructures (English)
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    branch-and-bound global optimization
    0 references
    factorable polyhedral relaxation
    0 references
    reformulation-linearization techniques
    0 references
    polynomial programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references