Pages that link to "Item:Q4509759"
From MaRDI portal
The following pages link to Nonmonotone Spectral Projected Gradient Methods on Convex Sets (Q4509759):
Displaying 50 items.
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems (Q1770091) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- A nonmonotone gradient algorithm for total variation image denoising problems (Q1793155) (← links)
- Minimization subproblems and heuristics for an applied clustering problem (Q1869508) (← links)
- Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. (Q1872927) (← links)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems (Q1938919) (← links)
- An investigation of feasible descent algorithms for estimating the condition number of a matrix (Q1939108) (← links)
- Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
- A cyclic projected gradient method (Q1946620) (← links)
- Linear convergence analysis of the use of gradient projection methods on total variation problems (Q1946623) (← links)
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties (Q1949585) (← links)
- A dual spectral projected gradient method for log-determinant semidefinite problems (Q1986103) (← links)
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method (Q1992541) (← links)
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints (Q1996996) (← links)
- Minimizing quadratic functions with semidefinite Hessian subject to bound constraints (Q2006489) (← links)
- A projection method for convex constrained monotone nonlinear equations with applications (Q2006525) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- Numerical method for the generalized nonnegative tensor factorization problem (Q2028020) (← links)
- A global Newton method for the nonsmooth vector fields on Riemannian manifolds (Q2046567) (← links)
- On the asymptotic convergence and acceleration of gradient methods (Q2053340) (← links)
- The gradient projection method with Armijo's step size on manifolds (Q2059547) (← links)
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- A view of computational models for image segmentation (Q2084578) (← links)
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
- Regularized graph cuts based discrete tomography reconstruction methods (Q2084613) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
- First-order methods for the convex hull membership problem (Q2106714) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- Stochastic tensor complementarity problem with discrete distribution (Q2116609) (← links)
- A matrix-free trust-region Newton algorithm for convex-constrained optimization (Q2119752) (← links)
- Inexact restoration for derivative-free expensive function minimization and applications (Q2122038) (← links)
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery (Q2130839) (← links)
- An extended projected residual algorithm for solving smooth convex optimization problems (Q2141614) (← links)
- A Newton Frank-Wolfe method for constrained self-concordant minimization (Q2141726) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming (Q2156911) (← links)
- An application-based characterization of dynamical distance geometry problems (Q2174892) (← links)
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
- Subsampled nonmonotone spectral gradient methods (Q2178981) (← links)
- A nonconvex truncated regularization and box-constrained model for CT reconstruction (Q2198001) (← links)
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints (Q2203094) (← links)
- A spectral conjugate gradient method for solving large-scale unconstrained optimization (Q2203770) (← links)
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery (Q2211072) (← links)
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices (Q2238337) (← links)
