Pages that link to "Item:Q312693"
From MaRDI portal
The following pages link to Primal and dual active-set methods for convex quadratic programming (Q312693):
Displaying 16 items.
- An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming (Q833407) (← links)
- A dual-active-set algorithm for positive semi-definite quadratic programming (Q1373722) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- Single image blind deblurring based on salient edge-structures and elastic-net regularization (Q2217371) (← links)
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- Globally convergent primal-dual active-set methods with inexact subproblem solves (Q2832889) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)
- Nonparametric density estimation with nonuniform B-spline bases (Q6126078) (← links)
- Optimal Subsampling via Predictive Inference (Q6651388) (← links)
