Pages that link to "Item:Q583116"

The following pages link to A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116):

Displaying 14 items.

• A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem (Q342108) (← links)
• The sagitta method for solving linear programs (Q703904) (← links)
• The probabilistic constraints in the support vector machine (Q990701) (← links)
• Penalty algorithm based on conjugate gradient method for solving portfolio management problem (Q1035576) (← links)
• A sparse counterpart of Reichel and Gragg's package QRUP (Q1044853) (← links)
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811) (← links)
• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
• Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
• Sparse kernel learning with LASSO and Bayesian inference algorithm (Q1784554) (← links)
• The adventures of a simple algorithm (Q1863543) (← links)
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)
• Model‐based solution approach for a short‐term flight rescheduling problem in aerial passenger transportation to maritime units (Q6060665) (← links)