Pages that link to "Item:Q2370027"

The following pages link to Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027):

Displaying 11 items.

• A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
• A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
• Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
• Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics (Q2006121) (← links)
• A predictor-corrector affine scaling method to train optimized extreme learning machine (Q2071232) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← 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)
• Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)
• Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
• Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves (Q2832889) (← links)