Pages that link to "Item:Q449548"
From MaRDI portal
The following pages link to An efficient algorithm for convex quadratic semi-definite optimization (Q449548):
Displaying 14 items.
- A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions (Q415217) (← links)
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs (Q613430) (← links)
- Algorithm for cardinality-constrained quadratic optimization (Q842777) (← links)
- An O(n) algorithm for least squares quasi-convex approximation (Q1097626) (← links)
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532) (← links)
- An Algorithm for Unconstrained Quadratically Penalized Convex Optimization (Q3087581) (← links)
- An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations (Q3200887) (← links)
- (Q3703659) (← links)
- (Q5457400) (← links)
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization (Q6584764) (← links)