The following pages link to (Q4517108):
Displayed 12 items.
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Relaxed maximum a posteriori fault identification (Q1016851) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs (Q2505379) (← links)