$L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices
From MaRDI portal
Publication:2832890
DOI10.1137/15M1048021zbMath1353.65055arXiv1608.06695OpenAlexW2963742264MaRDI QIDQ2832890
Ya-Feng Liu, ZaiWen Wen, Bo Jiang
Publication date: 15 November 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.06695
algorithmnumerical resultsquadratic assignment problempermutation matrixcutting planedoubly stochastic matrixnonmonotone line searchprojected gradient methodBarzilai-Borwein method\(L_p\) regularizationnegative proximal point
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (9)
Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM ⋮ An exact penalty approach for optimization with nonnegative orthogonality constraints ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ A brief introduction to manifold optimization ⋮ ADMM for the SDP relaxation of the QAP ⋮ A quadratic penalty method for hypergraph matching ⋮ On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope ⋮ Enhanced joint sparsity via iterative support detection ⋮ A time-triggered dimension reduction algorithm for the task assignment problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- A note on the complexity of \(L _{p }\) minimization
- Independent component analysis via nonparametric maximum likelihood estimation
- Smallest compact formulation for the permutahedron
- A survey for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Algorithms for assignment problems on an array processor
- The NP-completeness of the bandwidth minimization problem
- A genetic approach to the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Recent advances in the solution of quadratic assignment problems
- A greedy genetic algorithm for the quadratic assignment problem
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Greedy randomized adaptive search procedures
- Variable neighbourhood search for bandwidth reduction
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- An efficient continuation method for quadratic assignment problems
- The Quadratic Assignment Problem
- On Bounding the Bandwidth of Graphs with Symmetry
- The university of Florida sparse matrix collection
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Three Ideas for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- A new linearization method for quadratic assignment problems
- Convex Relaxations for Permutation Problems
- Two-Point Step Size Gradient Methods
- The bandwidth problem for graphs and matrices—a survey
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Comparison of iterative searches for the quadratic assignment problem
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- The Reactive Tabu Search
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Handbook of Combinatorial Optimization
- Computing the Nearest Doubly Stochastic Matrix with A Prescribed Entry
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices
