A proximal DC approach for quadratic assignment problem
From MaRDI portal
Publication:2028476
DOI10.1007/s10589-020-00252-5zbMath1469.90104arXiv1908.04522OpenAlexW3119925525MaRDI QIDQ2028476
Xinyuan Zhao, Zhuoxuan Jiang, Chao Ding
Publication date: 1 June 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04522
quadratic assignment problemaugmented Lagrangian methodrank constraintdoubly nonnegative programming
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Related Items
An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, Calmness of partial perturbation to composite rank constraint systems and its applications, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
Uses Software
Cites Work
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Exact penalty and error bounds in DC programming
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Bounds for the quadratic assignment problem using the bundle method
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- The computational complexity of some problems of linear algebra
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Semidefinite programming relaxations for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- DC programming and DCA: thirty years of developments
- Error bounds for rank constrained optimization problems and applications
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Lectures on Modern Convex Optimization
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
- Assignment Problems and the Location of Economic Activities
- Semidefinite optimization
- Clarke Subgradients of Stratifiable Functions
- Implicit Functions and Solution Mappings
- An Invitation to Tame Optimization
- Matrix Analysis
- Some NP-complete problems in quadratic and nonlinear programming
- P-Complete Approximation Problems
- Strong Duality for Semidefinite Programming
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- On Doubly Positive Semidefinite Programming Relaxations
- Semidefinite Programming
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- A Copositive Programming Approach to Graph Partitioning
- Convex Analysis
