Pages that link to "Item:Q1579656"
From MaRDI portal
The following pages link to A modified projection algorithm for large strictly-convex quadratic programs (Q1579656):
Displaying 13 items.
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- A new steplength selection for scaled gradient methods with application to image deblurring (Q897119) (← links)
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints (Q1996996) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- A variational approach to Gibbs artifacts removal in MRI (Q2084587) (← links)
- An improved gradient projection-based decomposition technique for support vector machines (Q2468369) (← links)
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
- A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint (Q2780890) (← links)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS (Q3560109) (← links)
- (Q3837121) (← links)
- Gradient projection methods for quadratic programs and applications in training support vector machines (Q5317754) (← links)
- On the working set selection in gradient projection-based decomposition techniques for support vector machines (Q5717544) (← links)
