Pages that link to "Item:Q3779680"
From MaRDI portal
The following pages link to Two-Point Step Size Gradient Methods (Q3779680):
Displaying 50 items.
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- On the asymptotic convergence and acceleration of gradient methods (Q2053340) (← links)
- A computational investigation of the effective viscosity of short-fiber reinforced thermoplastics by an FFT-based method (Q2058287) (← links)
- Particle-based energetic variational inference (Q2058750) (← links)
- Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications (Q2059821) (← links)
- An alternate gradient method for optimization problems with orthogonality constraints (Q2062445) (← links)
- The new spectral conjugate gradient method for large-scale unconstrained optimisation (Q2069403) (← links)
- A Riemannian rank-adaptive method for low-rank matrix completion (Q2070331) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- On \(R\)-linear convergence analysis for a class of gradient methods (Q2070335) (← links)
- Stabilization of nonautonomous parabolic equations by a single moving actuator (Q2075105) (← links)
- A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint (Q2075960) (← links)
- Distributed adaptive Huber regression (Q2076119) (← links)
- The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation (Q2078458) (← links)
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing (Q2083385) (← links)
- Level set of the asymptotic rate of convergence for the method of steepest descent (Q2084237) (← links)
- A variational approach to Gibbs artifacts removal in MRI (Q2084587) (← 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)
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors (Q2085661) (← links)
- Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization (Q2086938) (← links)
- An accelerated Sobolev gradient method for unconstrained optimization problems based on variable inner products (Q2087526) (← links)
- A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration (Q2088825) (← links)
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization (Q2088969) (← links)
- A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations (Q2089889) (← links)
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction (Q2091131) (← links)
- Manifold reconstruction and denoising from scattered data in high dimension (Q2095140) (← links)
- Error estimates for mixed and hybrid FEM for elliptic optimal control problems with penalizations (Q2095528) (← links)
- A first order reliability method based on hybrid conjugate approach with adaptive Barzilai-Borwein steps (Q2096903) (← links)
- A class of line search-type methods for nonsmooth convex regularized minimization (Q2098339) (← links)
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares (Q2106221) (← links)
- Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications (Q2106234) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities (Q2114595) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
- Stochastic tensor complementarity problem with discrete distribution (Q2116609) (← links)
- Mixed and hybrid Petrov-Galerkin finite element discretization for optimal control of the wave equation (Q2117307) (← links)
- A hybrid approach for finding approximate solutions to constrained nonlinear monotone operator equations with applications (Q2123242) (← links)
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations (Q2125067) (← links)
- Accelerating mini-batch SARAH by step size rules (Q2127094) (← links)
- A structure-preserving, operator splitting scheme for reaction-diffusion equations with detailed balance (Q2131061) (← links)
- An online conjugate gradient algorithm for large-scale data analysis in machine learning (Q2131556) (← links)
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization (Q2132432) (← links)
- A parallel orbital-updating based optimization method for electronic structure calculations (Q2133051) (← links)
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
- On initial point selection of the steepest descent algorithm for general quadratic functions (Q2141353) (← 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)
