Pages that link to "Item:Q3093053"
From MaRDI portal
The following pages link to Solving quadratically constrained convex optimization problems with an interior-point method (Q3093053):
Displaying 12 items.
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- Convex optimization approach to a single quadratically constrained quadratic minimization problem (Q623792) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- On implementing a primal-dual interior-point method for conic quadratic optimization (Q1411641) (← links)
- A non-interior path following method for convex quadratic programming problems with bound constraints (Q1430274) (← links)
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization (Q1681794) (← links)
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Using interior point solvers for optimizing progressive lens models with spherical coordinates (Q2218898) (← links)
- An interior point method and Sherman-Morrison formula for solving large scale convex quadratic problems with diagonal Hessians (Q2822073) (← links)
- Solving conic quadratically constrained quadratic programming problems (Q2928413) (← links)
- The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
