Pages that link to "Item:Q2706239"
From MaRDI portal
The following pages link to On Lagrangian relaxation of quadratic matrix constraints (Q2706239):
Displaying 45 items.
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Sufficient global optimality conditions for bivalent quadratic optimization (Q702386) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
- Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones (Q996334) (← links)
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
- Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint (Q1041439) (← links)
- Relaxation of a quadratic functional defined by a nonnegative unbounded matrix (Q1300249) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- Strong duality for a trust-region type relaxation of the quadratic assignment problem (Q1970512) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
- A tighter relaxation for the relative pose problem between cameras (Q2163347) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints (Q2768043) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations (Q2940065) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- On the equivariance properties of self-adjoint matrices (Q3298332) (← links)
- A lagrangean relaxation algorithm for the constrained matrix problem (Q3734170) (← links)
- (Q4218859) (← links)
- (Q4368560) (← links)
- A Lagrangian Relaxation for Golomb Rulers (Q4922916) (← links)
- Algorithm 996 (Q4960955) (← links)
- Gromov–Wasserstein distances between Gaussian distributions (Q5049903) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900323) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold (Q6596339) (← links)