A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
From MaRDI portal
Publication:2696928
DOI10.1007/s10589-022-00443-2OpenAlexW4312202296MaRDI QIDQ2696928
Shujun Bi, Shaohua Pan, Yitian Qian
Publication date: 17 April 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00443-2
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Mathematical programming (90Cxx)
Uses Software
Cites Work
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Approximation algorithms for discrete polynomial optimization
- The unconstrained binary quadratic programming problem: a survey
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- On metric and calmness qualification conditions in subdifferential calculus
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A quadratic assignment formulation of the molecular conformation problem
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Nonsmooth analysis of eigenvalues
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- A proximal difference-of-convex algorithm with extrapolation
- DC programming and DCA: thirty years of developments
- Error bounds for rank constrained optimization problems and applications
- A proximal DC approach for quadratic assignment problem
- Discrete dynamical system approaches for Boolean polynomial optimization
- Prox-regularity of rank constraint sets and implications for algorithms
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Global Optimization with Polynomials and the Problem of Moments
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Computing B-Stationary Points of Nonsmooth DC Programs
- Guaranteed Matrix Completion via Non-Convex Factorization
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- BiqCrunch
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- GloptiPoly 3: moments, optimization and semidefinite programming
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Variational Analysis
- On Doubly Positive Semidefinite Programming Relaxations
- A Decomposition Method for Quadratic Zero-One Programming
- The non-convex geometry of low-rank matrix optimization
- Convex Analysis
- A branch and bound algorithm for the maximum clique problem
