Pages that link to "Item:Q1947612"
From MaRDI portal
The following pages link to Dual fast projected gradient method for quadratic programming (Q1947612):
Displaying 10 items.
- A new fast algorithm for constrained four-directional total variation image denoising problem (Q1666647) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- Soft inequality constraints in gradient method and fast gradient method for quadratic programming (Q2331372) (← links)
- Fast projected gradient method for support vector machines (Q2358069) (← links)
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
- A finite gradient-projective solver for a quadratic programming problem (Q2870272) (← links)
- Benchmarking large-scale distributed convex quadratic programming algorithms (Q2943814) (← links)
- (Q5140714) (← links)
- Gradient projection-based performance improvement for JLQ problems (Q5745549) (← links)
- On computational search for Nash equilibrium in hexamatrix games (Q5963237) (← links)