Pages that link to "Item:Q2356335"
From MaRDI portal
The following pages link to Methods for convex and general quadratic programming (Q2356335):
Displayed 11 items.
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- A study of structure-exploiting SQP algorithms for an optimal control problem with coupled hyperbolic and ordinary differential equation constraints (Q1713287) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
- Nonparametric density estimation with nonuniform B-spline bases (Q6126078) (← links)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)