Pages that link to "Item:Q2028483"
From MaRDI portal
The following pages link to An interior point-proximal method of multipliers for convex quadratic programming (Q2028483):
Displaying 12 items.
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- An interior point-proximal method of multipliers for linear positive semi-definite programming (Q2073047) (← links)
- Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- Sparse Approximations with Interior Point Methods (Q5044994) (← links)
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy (Q5057773) (← links)
- General-purpose preconditioning for regularized interior point methods (Q6043128) (← links)
- Generation matrix: an embeddable matrix representation for hierarchical trees (Q6057832) (← links)
- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming (Q6064060) (← links)
- On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
- Combined Newton-gradient method for constrained root-finding in chemical reaction networks (Q6142077) (← links)
- Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques (Q6167085) (← links)