Pages that link to "Item:Q3779680"

The following pages link to Two-Point Step Size Gradient Methods (Q3779680):

Displaying 50 items.

• 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 extended delayed weighted gradient algorithm for solving strongly convex optimization problems (Q2161068) (← links)
• Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors (Q2163582) (← links)
• Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model (Q2165892) (← links)
• Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization (Q2171075) (← links)
• A new smoothing spectral conjugate gradient method for solving tensor complementarity problems (Q2171089) (← links)
• A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
• A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils (Q2177925) (← links)
• A note on the spectral gradient projection method for nonlinear monotone equations with applications (Q2178576) (← links)
• Subsampled nonmonotone spectral gradient methods (Q2178981) (← links)
• Separating variables to accelerate non-convex regularized optimization (Q2181546) (← links)
• On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems (Q2181674) (← links)
• Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces (Q2188946) (← links)
• Two-point step size gradient method for solving a deep learning problem (Q2190628) (← links)
• A modified scaled memoryless symmetric rank-one method (Q2193423) (← links)
• Fast gradient methods with alignment for symmetric linear systems without using Cauchy step (Q2195925) (← links)
• Effective algorithms for solving trace minimization problem in multivariate statistics (Q2196916) (← links)
• Discrete processes and their continuous limits (Q2197184) (← links)
• Phase retrieval: a data-driven wavelet frame based approach (Q2197956) (← links)
• Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction (Q2198239) (← links)
• Effective zero-norm minimization algorithms for noisy compressed sensing (Q2198627) (← links)
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
• Optimal non-negative forecast reconciliation (Q2209697) (← links)
• A gradient descent method for solving a system of nonlinear equations (Q2213706) (← links)
• A family of modified spectral projection methods for nonlinear monotone equations with convex constraint (Q2214774) (← links)
• Optimization for deep learning: an overview (Q2218095) (← links)
• Scaled projected-directions methods with application to transmission tomography (Q2218907) (← links)
• A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
• Variable metric techniques for forward-backward methods in imaging (Q2222135) (← links)
• Efficient algorithms for solving condition number-constrained matrix minimization problems (Q2226404) (← links)
• Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph (Q2227186) (← links)
• A new projected Barzilai-Borwein method for the symmetric cone complementarity problem (Q2227325) (← links)
• New stepsizes for the gradient method (Q2228379) (← links)
• A linearly convergent stochastic recursive gradient method for convex optimization (Q2228399) (← links)
• Accelerated diagonal gradient-type method for large-scale unconstrained optimization (Q2228737) (← links)
• Cayley-transform-based gradient and conjugate gradient algorithms on Grassmann manifolds (Q2230688) (← links)
• On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
• A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints (Q2231300) (← links)
• A class of accelerated subspace minimization conjugate gradient methods (Q2231338) (← links)
• A review of nonlinear FFT-based computational homogenization methods (Q2234259) (← links)
• Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials (Q2236133) (← links)
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
• A second-order gradient method for convex minimization (Q2236579) (← links)
• Solving the discrete Euler-Arnold equations for the generalized rigid body motion (Q2237926) (← links)
• An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices (Q2238337) (← links)
• Fused Lasso approach in portfolio selection (Q2241053) (← links)
• One-bit tensor completion via transformed tensor singular value decomposition (Q2242530) (← links)
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
• Using gradient directions to get global convergence of Newton-type methods (Q2244123) (← links)