Pages that link to "Item:Q1159135"
From MaRDI portal
The following pages link to A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems (Q1159135):
Displaying 6 items.
- Computation of efficient compromise arcs in convex quadratic multicriteria optimization (Q813340) (← links)
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
- Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints (Q1206605) (← links)
- Controlled dual perturbations for l p -programming (Q3734177) (← links)
- Impproving the rate of convergence of the logarithmic barrier function method (Q4351191) (← links)
- Controlled perturbations for quadratically constrained quadratic programs (Q4726047) (← links)
