An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems of distance geometry and convex properties of quadratic maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden convexity in some nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected gradient algorithm for solving the maxcut SDP relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local minima and convergence in low-rank semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Penalty Functions in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between semidefinite relaxations of the max-cut and stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: First- and second-order methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations / rank
 
Normal rank

Latest revision as of 19:10, 3 July 2024

scientific article
Language Label Description Also known as
English
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
scientific article

    Statements

    An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2011
    0 references
    0 references
    semidefinite programming
    0 references
    low-rank factorization
    0 references
    maxcut problem
    0 references
    nonlinear programming
    0 references
    exact penalty functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references