Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: SQP algorithms for solving Toeplitz matrix approximation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid methods for approximating Hankel matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity Maps for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Restricted Least Squares Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Definite Matrix Constraints in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest correlation matrix--a problem from finance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite bounding procedure for solving max-cut problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Operators (AM-22), Volume 2 / rank
 
Normal rank

Revision as of 08:59, 26 July 2024

scientific article; zbMATH DE number 7380892
Language Label Description Also known as
English
Global convergence of the alternating projection method for the Max-Cut relaxation problem
scientific article; zbMATH DE number 7380892

    Statements

    Global convergence of the alternating projection method for the Max-Cut relaxation problem (English)
    0 references
    0 references
    0 references
    11 August 2021
    0 references
    alternating projections method
    0 references
    global convergence
    0 references
    max-cut problem
    0 references

    Identifiers