Pages that link to "Item:Q689102"
From MaRDI portal
The following pages link to A long-step barrier method for convex quadratic programming (Q689102):
Displaying 8 items.
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- A long-step primal-dual path-following method for semidefinite programming (Q1306474) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
- An interior point method for general large-scale quadratic programming problems (Q1915920) (← links)
- A path following algorithm for a class of convex programming problems (Q4016864) (← links)
- Computing Maximum Likelihood Estimators of Convex Density Functions (Q4389265) (← links)
