The following pages link to (Q3348711):
Displaying 12 items.
- A new trust-region method for solving systems of equalities and inequalities (Q520331) (← links)
- A convergent decomposition method for box-constrained optimization problems (Q839804) (← links)
- Merging of Bézier curves with box constraints (Q898952) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
- A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints (Q2756554) (← links)
- (Q5158522) (← links)
- (Q5492033) (← links)