A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Jointly constrained bilinear programs and related problems: An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized bilinear programming. I: Models, applications and linear programming relaxation / 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 a quadratic function subject to a bounded mixed integer constraint set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for indefinite integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Design—A Special Case in Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear programming and structured stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Strategy for Global Optimum Search in the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-relaxed dual global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear approach to the pooling problem† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of indefinite quadratic programs to bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically constrained quadratic programming: Some applications and a method for solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994364 / 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: Dual quadratic estimates in polynomial and Boolean programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with a Quadratic Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints / rank
 
Normal rank

Revision as of 13:58, 23 May 2024

scientific article
Language Label Description Also known as
English
A relaxation method for nonconvex quadratically constrained quadratic programs
scientific article

    Statements

    A relaxation method for nonconvex quadratically constrained quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    19 June 1995
    0 references
    relaxation linearization technique
    0 references
    approximate global solutions
    0 references
    quadratically constrained quadratic programming
    0 references
    outer approximation
    0 references
    branch-and-bound
    0 references
    linear programming subproblems
    0 references
    0 references
    0 references
    0 references

    Identifiers