On Lagrangian Relaxation of Quadratic Matrix Constraints

From MaRDI portal
Revision as of 11:03, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (35)

Copositive and semidefinite relaxations of the quadratic assignment problemGromov–Wasserstein distances between Gaussian distributionsA tighter relaxation for the relative pose problem between camerasSums of random symmetric matrices and quadratic optimization under orthogonality constraintsA computational study of global optimization solvers on two trust region subproblemsEfficient Use of Semidefinite Programming for Selection of Rotamers in Protein ConformationsA survey of hidden convex optimizationSemidefinite approximations for quadratic programs over orthogonal matricesOn Integrality in Semidefinite Programming for Discrete OptimizationAn Efficient Semidefinite Programming Relaxation for the Graph Partition ProblemGlobal optimization of a class of nonconvex quadratically constrained quadratic programming problemsConvex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximationA new semidefinite programming relaxation scheme for a class of quadratic matrix problemsMoment inequalities for sums of random matrices and their applications in optimizationSemidefinite programming relaxations for the graph partitioning problemOn the equivariance properties of self-adjoint matricesOn improving convex quadratic programming relaxation for the quadratic assignment problemExactness criteria for SDP-relaxations of quadratic extremum problemsUsing conical regularization in calculating Lagrangian estimates in quadratic optimization problemsThe MIN-cut and vertex separator problemEquivalences and differences in conic relaxations of combinatorial quadratic optimization problemsSemidefinite programming for discrete optimization and matrix completion problemsSufficient global optimality conditions for bivalent quadratic optimizationSecond order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programmingA proximal DC approach for quadratic assignment problemEigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problemSDP Relaxations for Some Combinatorial Optimization ProblemsAlgorithm 996Exact dual bounds for some nonconvex minimax quadratic optimization problemsContinuous relaxations for the traveling salesman problemA convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoidMatrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraintA note on lack of strong duality for quadratic problems with orthogonal constraintsStrengthened semidefinite relaxations via a second lifting for the Max-Cut problemRecent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods







This page was built for publication: On Lagrangian Relaxation of Quadratic Matrix Constraints