Pages that link to "Item:Q3779680"
From MaRDI portal
The following pages link to Two-Point Step Size Gradient Methods (Q3779680):
Displaying 50 items.
- A joint matrix minimization approach for multi-image face recognition (Q1656900) (← links)
- Multiple graphs clustering by gradient flow method (Q1661459) (← links)
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
- Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing (Q1664790) (← links)
- A transformation of accelerated double step size method for unconstrained optimization (Q1665226) (← links)
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization (Q1666716) (← links)
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization (Q1670017) (← links)
- An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
- A double parameter scaled BFGS method for unconstrained optimization (Q1677470) (← links)
- Receding horizon control for the stabilization of the wave equation (Q1678206) (← links)
- Numerical solution of huge-scale quasiseparable optimization problems (Q1682811) (← links)
- A regularized Newton method for computing ground states of Bose-Einstein condensates (Q1685513) (← links)
- Orbital minimization method with \(\ell^{1}\) regularization (Q1685597) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- A spectral algorithm for large-scale systems of nonlinear monotone equations (Q1689459) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- Shrinking gradient descent algorithms for total variation regularized image denoising (Q1694398) (← links)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- A unified formulation for generalized oilfield development optimization (Q1702333) (← links)
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework (Q1712546) (← links)
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization (Q1713247) (← links)
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization (Q1715914) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
- Accelerated double direction method for solving unconstrained optimization problems (Q1719483) (← links)
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing (Q1724067) (← links)
- A new method with sufficient descent property for unconstrained optimization (Q1725328) (← links)
- A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems (Q1725601) (← links)
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
- Prediction-correction method with BB step sizes (Q1731902) (← links)
- A note on a multiplicative parameters gradient method (Q1733405) (← links)
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems (Q1736403) (← links)
- Reducing effects of bad data using variance based joint sparsity recovery (Q1736886) (← links)
- A new derivative-free SCG-type projection method for nonlinear monotone equations with convex constraints (Q1743362) (← links)
- On a scalable nonparametric denoising of time series signals (Q1746928) (← links)
- Stochastic gradient descent with Barzilai-Borwein update step for SVM (Q1749833) (← links)
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization (Q1751056) (← links)
- Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization (Q1760876) (← links)
- 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 new family of conjugate gradient methods for unconstrained optimization (Q1786950) (← links)
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm (Q1790679) (← links)
- A nonmonotone gradient algorithm for total variation image denoising problems (Q1793155) (← links)
- A maxentropic procedure for reconstructing a distribution from its marginals (Q1816641) (← links)
- Nonlinear orthomin\((k)\) methods (Q1855100) (← links)