A reformulation-linearization technique for optimization over simplices (Q2689826): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-021-01726-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3213785041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / 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: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortfall as a risk measure: properties, optimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of optimization over the standard simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global optimization with indefinite quadratics / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms / 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: How to generate random matrices from the classical compact groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: GLOMIQO: global mixed-integer quadratic optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / 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: 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

Latest revision as of 17:22, 31 July 2024

scientific article
Language Label Description Also known as
English
A reformulation-linearization technique for optimization over simplices
scientific article

    Statements

    A reformulation-linearization technique for optimization over simplices (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    reformulation-linearization technique
    0 references
    global optimization
    0 references
    semidefinite optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references