Pages that link to "Item:Q3337228"
From MaRDI portal
The following pages link to Randomly Generated Test Problems for Positive Definite Quadratic Programming (Q3337228):
Displaying 10 items.
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
- Value estimation approach to the Iri-Imai method for constrained convex optimization (Q2569197) (← links)
- A repository of convex quadratic programming problems (Q4504798) (← links)
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs<sup>∗</sup> (Q4514287) (← links)
- Near optimal step size and momentum in gradient descent for quadratic functions (Q4633246) (← links)
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
- Adaptive consensus: a network pruning approach for decentralized optimization (Q6644846) (← links)