Pages that link to "Item:Q688916"
From MaRDI portal
The following pages link to A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions (Q688916):
Displaying 12 items.
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems (Q489124) (← links)
- A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← links)
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
- An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints (Q2485615) (← links)
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables (Q2489419) (← links)
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793) (← links)
- The Convergent Generalized Central Paths for Linearly Constrained Convex Programming (Q4641644) (← links)
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
