Pages that link to "Item:Q1572673"
From MaRDI portal
The following pages link to Approximating quadratic programming with bound and quadratic constraints (Q1572673):
Displaying 18 items.
- An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables (Q4209867) (← links)
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint (Q4639117) (← links)
- Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints (Q4909732) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
- LMI-based robust mixed-integer model predictive control for hybrid systems (Q5130053) (← links)
- Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization (Q5151536) (← links)
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints (Q5444278) (← links)
- Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
- Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726) (← links)
- LMI approximations for the radius of the intersection of ellipsoids: Survey. (Q5929424) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
- Effective algorithms for optimal portfolio deleveraging problem with cross impact (Q6178391) (← links)
