Pages that link to "Item:Q3718152"
From MaRDI portal
The following pages link to A Variable-Complexity Norm Maximization Problem (Q3718152):
Displayed 6 items.
- Computational complexity of norm-maximization (Q757258) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs (Q1058992) (← links)
- The design centering problem as a d.c. programming problem (Q1106730) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Hoffman's least error bounds for systems of linear inequalities (Q2574102) (← links)