Pages that link to "Item:Q2954394"
From MaRDI portal
The following pages link to Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394):
Displaying 16 items.
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares (Q816068) (← links)
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
- Embedded maximal ellipsoids and semi-infinite optimization (Q1892766) (← links)
- On maximization of quadratic form over intersection of ellipsoids with common center (Q1968792) (← links)
- Ellipsoidal one-class constraint acquisition for quadratically constrained programming (Q2030498) (← links)
- On local nonglobal minimum of trust-region subproblem and extension (Q2093294) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- Une borne optimale pour la programmation entière quasi-convexe (Q3136700) (← links)
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm (Q3818123) (← links)
- (Q4388599) (← links)
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm (Q4702342) (← links)
