Pages that link to "Item:Q1935878"
From MaRDI portal
The following pages link to Unconstrained formulation of standard quadratic optimization problems (Q1935878):
Displaying 12 items.
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations (Q427394) (← links)
- A class of differential quadratic programming problems (Q670795) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- On standard quadratic optimization problems (Q1281478) (← links)
- Separable standard quadratic optimization problems (Q1758025) (← links)
- A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
- On a continuous approach for the maximum weighted clique problem (Q2392119) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
- Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems (Q4987691) (← links)