Pages that link to "Item:Q3454512"
From MaRDI portal
The following pages link to A Solver for Nonconvex Bound-Constrained Quadratic Optimization (Q3454512):
Displaying 11 items.
- A non-interior path following method for convex quadratic programming problems with bound constraints (Q1430274) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
- A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers (Q2208931) (← links)
- Exploiting negative curvature in deterministic and stochastic optimization (Q2425164) (← links)
- Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
- On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
