Difference of convex solution of quadratically constrained optimization problems. (Q1810525): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A relaxation method for nonconvex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and off-line vertex enumeration by adjacency lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave minimization via conical partitions and polyhedral outer approximation / 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: Q3761588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical DC programming problem: Outer approximation methods revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global minimization of a convex function under general nonconvex constraints / rank
 
Normal rank

Latest revision as of 17:22, 5 June 2024

scientific article
Language Label Description Also known as
English
Difference of convex solution of quadratically constrained optimization problems.
scientific article

    Statements

    Difference of convex solution of quadratically constrained optimization problems. (English)
    0 references
    0 references
    0 references
    9 June 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    Global optimization
    0 references
    Difference of convex programming
    0 references
    Outer approximation
    0 references
    Branch and bound
    0 references