On Lagrangian Relaxation of Quadratic Matrix Constraints
From MaRDI portal
Publication:2706239
DOI10.1137/S0895479898340299zbMath0990.90088OpenAlexW2035400420MaRDI QIDQ2706239
Henry Wolkowicz, Kurt M. Anstreicher
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479898340299
semidefinite programmingquadratic assignmentgraph partitioningquadratically constrained quadratic programsLagrangian relaxationsmax-cut problems
Semidefinite programming (90C22) Quadratic programming (90C20) Combinatorial optimization (90C27) Convex functions and convex programs in convex geometry (52A41)
Related Items
Copositive and semidefinite relaxations of the quadratic assignment problem, Gromov–Wasserstein distances between Gaussian distributions, A tighter relaxation for the relative pose problem between cameras, Sums of random symmetric matrices and quadratic optimization under orthogonality constraints, A computational study of global optimization solvers on two trust region subproblems, Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations, A survey of hidden convex optimization, Semidefinite approximations for quadratic programs over orthogonal matrices, On Integrality in Semidefinite Programming for Discrete Optimization, An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem, Global optimization of a class of nonconvex quadratically constrained quadratic programming problems, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, A new semidefinite programming relaxation scheme for a class of quadratic matrix problems, Moment inequalities for sums of random matrices and their applications in optimization, Semidefinite programming relaxations for the graph partitioning problem, On the equivariance properties of self-adjoint matrices, On improving convex quadratic programming relaxation for the quadratic assignment problem, Exactness criteria for SDP-relaxations of quadratic extremum problems, Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems, The MIN-cut and vertex separator problem, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, Semidefinite programming for discrete optimization and matrix completion problems, Sufficient global optimality conditions for bivalent quadratic optimization, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, A proximal DC approach for quadratic assignment problem, Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem, SDP Relaxations for Some Combinatorial Optimization Problems, Algorithm 996, Exact dual bounds for some nonconvex minimax quadratic optimization problems, Continuous relaxations for the traveling salesman problem, A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid, Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint, A note on lack of strong duality for quadratic problems with orthogonal constraints, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
