A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-022-00443-2 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-022-00443-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4312202296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for rank constrained optimization problems and applications / 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: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Doubly Positive Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification-driven tabu search for unconstrained binary quadratic problems / 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: Approximation algorithms for discrete polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric and calmness qualification conditions in subdifferential calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal DC approach for quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unconstrained binary quadratic programming problem: a survey / 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: BiqCrunch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming and DCA: thirty years of developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth analysis of eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The non-convex geometry of low-rank matrix optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prox-regularity of rank constraint sets and implications for algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete dynamical system approaches for Boolean polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing B-Stationary Points of Nonsmooth DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic assignment formulation of the molecular conformation problem / 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: An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem / 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: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Matrix Completion via Non-Convex Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal difference-of-convex algorithm with extrapolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible method for optimization with orthogonality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-022-00443-2 / rank
 
Normal rank

Latest revision as of 20:07, 19 December 2024

scientific article
Language Label Description Also known as
English
A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
scientific article

    Statements

    A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (English)
    0 references
    0 references
    0 references
    0 references
    17 April 2023
    0 references
    UBPP
    0 references
    matrix nonconvex relaxation approach
    0 references
    global DC exact penalty
    0 references
    burer-monteiro factorization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references