Pages that link to "Item:Q4687242"

The following pages link to A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242):

Displaying 13 items.

• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
• Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
• On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
• Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
• Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming (Q2156911) (← links)
• A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers (Q2208931) (← links)
• Using gradient directions to get global convergence of Newton-type methods (Q2244123) (← links)
• ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration (Q2284080) (← links)
• A two-phase method for solving continuous rank-one quadratic knapsack problems (Q5054022) (← links)
• On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
• Combined Newton-gradient method for constrained root-finding in chemical reaction networks (Q6142077) (← links)
• Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems (Q6640996) (← links)