Pages that link to "Item:Q2297665"
From MaRDI portal
The following pages link to A polynomial algorithm for convex quadratic optimization subject to linear inequalities (Q2297665):
Displaying 11 items.
- A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions (Q415217) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- A note on the strong polynomiality of convex quadratic programming (Q1804355) (← links)
- A class of polynomial variable metric algorithms for linear optimization (Q1814798) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- A polynomial-time algorithm for affine variational inequalities (Q2639604) (← links)
- (Q3474482) (← links)
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267) (← links)
- Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems (Q5010045) (← links)
- A Generalized Simplex Method for Integer Problems Given by Verification Oracles (Q5853568) (← links)
- A convex optimization model for finding non-negative polynomials (Q5965344) (← links)
