Pages that link to "Item:Q1260618"
From MaRDI portal
The following pages link to An interior point method for quadratic programs based on conjugate projected gradients (Q1260618):
Displaying 15 items.
- On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Parallel interior-point method for linear and quadratic programs with special structure (Q1608140) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- An interior point method for general large-scale quadratic programming problems (Q1915920) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← links)
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- A primal-dual interior-point algorithm for quadratic programming (Q2502230) (← links)
- Sparsity in convex quadratic programming with interior point methods (Q3423592) (← links)
- Numerically stable LDLT factorizations in interior point methods for convex quadratic programming (Q3543422) (← links)
- Interior dual proximal point algorithm using preconditioned conjugate gradient † (Q4327905) (← links)
