Pages that link to "Item:Q3779680"

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

Displaying 50 items.

• Anderson-accelerated polarization schemes for fast Fourier transform-based computational homogenization (Q6553942) (← links)
• On non-stationary polarization methods in FFT-based computational micromechanics (Q6554037) (← links)
• Lippmann-Schwinger solvers for the computational homogenization of materials with pores (Q6554333) (← links)
• Turing instability analysis and parameter identification based on optimal control and statistics method for a rumor propagation system (Q6555042) (← links)
• On the Barzilai-Borwein basic scheme in FFT-based computational homogenization (Q6555396) (← links)
• Price competition with differentiated products on a two-dimensional plane: the impact of partial cartel on firms' profits and behavior (Q6555598) (← links)
• Solving nonlinear equations with the convex combination of two positive spectral coefficients (Q6556167) (← links)
• A structured L-BFGS method and its application to inverse problems (Q6557640) (← links)
• A proximal neurodynamic model for a system of non-linear inverse mixed variational inequalities (Q6558455) (← links)
• A novel stepsize for gradient descent method (Q6564290) (← links)
• A stochastic variance reduced gradient method with adaptive step for stochastic optimization (Q6565722) (← links)
• A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses (Q6566776) (← links)
• Proximal gradient methods beyond monotony (Q6567228) (← links)
• A hybrid BFGS-like method for monotone operator equations with applications (Q6567282) (← links)
• Stabilized BB projection algorithm for large-scale convex constrained nonlinear monotone equations to signal and image processing problems (Q6569153) (← links)
• A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem (Q6574066) (← links)
• A novel residual subsampling method for skew-normal mode regression model with massive data (Q6579762) (← links)
• Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem (Q6580208) (← links)
• A sufficient descent LS-PRP-BFGS-like method for solving nonlinear monotone equations with application to image restoration (Q6582389) (← links)
• Another Hager-Zhang-type method via singular-value study for constrained monotone equations with application (Q6582394) (← links)
• An inertial Fletcher-Reeves-type conjugate gradient projection-based method and its spectral extension for constrained nonlinear equations (Q6584782) (← links)
• Iterative singular tube hard thresholding algorithms for tensor recovery (Q6587556) (← links)
• Stochastic variance reduced gradient for affine rank minimization problem (Q6587638) (← links)
• Gaussian differentially private robust mean estimation and inference (Q6589584) (← links)
• A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization (Q6593314) (← links)
• A family of spectral conjugate gradient methods with strong convergence and its applications in image restoration and machine learning (Q6593741) (← links)
• A stabilized simulated annealing based Barzilai-Borwein method for the solution of unconstrained optimization problems (Q6599691) (← links)
• Algorithm 1030: SC-SR1: MATLAB software for limited-memory SR1 trust-region methods (Q6599988) (← links)
• Mean-payoff optimization in continuous-time Markov chains with parametric alarms (Q6600073) (← links)
• Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm (Q6601376) (← links)
• Cyclic gradient methods for unconstrained optimization (Q6601975) (← links)
• Subsampled first-order optimization methods with applications in imaging (Q6606441) (← links)
• The Potts model with different piecewise constant representations and fast algorithms: a survey (Q6606497) (← links)
• Stochastic Steffensen method (Q6606849) (← links)
• Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization (Q6606853) (← links)
• New gradient methods with adaptive stepsizes by approximate models (Q6611221) (← links)
• A projection method for zeros of multi-valued monotone mappings (Q6612328) (← links)
• On the inversion-free Newton's method and its applications (Q6612368) (← links)
• Nonmonotone local minimax methods for finding multiple saddle points (Q6617003) (← links)
• A low-cost optimization approach for solving minimum norm linear systems and linear least-squares problems (Q6617006) (← links)
• Lasso estimation of hierarchical interactions for analyzing heterogeneity of treatment effect (Q6628229) (← links)
• A hybrid direct search and projected simplex gradient method for convex constrained minimization (Q6640994) (← links)
• Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems (Q6640996) (← links)
• Risk budgeting portfolios: existence and computation (Q6641077) (← links)
• A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization (Q6642792) (← links)
• Shape-changing trust-region methods using multipoint symmetric secant matrices (Q6644991) (← links)
• AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems (Q6644996) (← links)
• Acceleration of a projected gradient algorithm for the Bingham flow problem by rigidity enforcement with penalty (Q6646777) (← links)
• A new diagonal quasi-Newton algorithm for unconstrained optimization problems. (Q6648031) (← links)
• Reconstruction of Voronoi diagrams in inverse potential problems (Q6652882) (← links)