Pages that link to "Item:Q4504798"

The following pages link to A repository of convex quadratic programming problems (Q4504798):

Displaying 38 items.

• OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
• A class of primal affine scaling algorithms (Q427024) (← links)
• qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
• A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
• Advances in design and implementation of optimization software (Q1598765) (← links)
• Threshold incomplete factorization constraint preconditioners for saddle-point matrices (Q1743074) (← links)
• A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
• An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
• Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
• On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming (Q2219452) (← links)
• An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
• COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
• Solving quadratic programs to high precision using scaled iterative refinement (Q2293654) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521) (← links)
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
• A secant-based Nesterov method for convex functions (Q2361131) (← links)
• Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
• A comparison of reduced and unreduced KKT systems arising from interior point methods (Q2401021) (← links)
• Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
• Steplength selection in interior-point methods for quadratic programming (Q2455431) (← links)
• A primal-dual interior-point algorithm for quadratic programming (Q2502230) (← links)
• Benchmarking large-scale distributed convex quadratic programming algorithms (Q2943814) (← links)
• Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods (Q2955981) (← links)
• Sparsity in convex quadratic programming with interior point methods (Q3423592) (← links)
• Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization (Q4504784) (← links)
• Block BFGS Methods (Q4641646) (← links)
• Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem (Q5010047) (← links)
• Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy (Q5057773) (← links)
• An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint (Q5870141) (← links)
• General-purpose preconditioning for regularized interior point methods (Q6043128) (← links)
• IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming (Q6064060) (← links)
• A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming (Q6166646) (← links)
• Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques (Q6167085) (← links)