The following pages link to (Q4215365):
Displaying 22 items.
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- A factorization with update procedures for a KKT matrix arising in direct optimal control (Q384809) (← links)
- An active set solver for input-constrained robust receding horizon control (Q463808) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
- Efficient implementation of an active set algorithm for large-scale portfolio selection (Q925841) (← links)
- Homotopy continuation approaches for robust SV classification and regression (Q1697922) (← links)
- Optimizing 3-objective portfolio selection with equality constraints and analyzing the effect of varying constraints on the efficient sets (Q1983708) (← links)
- Conditional selective inference for robust regression and outlier detection using piecewise-linear homotopy continuation (Q2087410) (← links)
- Classifying the minimum-variance surface of multiple-objective portfolio selection for capital asset pricing models (Q2150776) (← links)
- Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming (Q2267663) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- On the criterion vectors of lines of portfolio selection with multiple quadratic and multiple linear objectives (Q2358185) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- Robust Markowitz: comprehensively maximizing Sharpe ratio by parametric-quadratic programming (Q2691241) (← links)
- Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves (Q2832889) (← links)
- The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems (Q4640325) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts (Q5254996) (← links)
- An online active set strategy to overcome the limitations of explicit MPC (Q5405758) (← links)
- Parametrically computing efficient frontiers and reanalyzing efficiency-diversification discrepancies and naive diversification (Q5884380) (← links)
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) (← links)
