Pages that link to "Item:Q3779680"

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

Displaying 50 items.

• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• Nonmonotone derivative-free methods for nonlinear equations (Q2385543) (← links)
• Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems (Q2387319) (← links)
• Steepest descent method with random step lengths (Q2397745) (← links)
• Regularization and numerical solution of the inverse scattering problem using shearlet frames (Q2397869) (← links)
• A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems (Q2397872) (← links)
• Trace-penalty minimization for large-scale eigenspace computation (Q2398478) (← links)
• Computing extreme eigenvalues of large scale Hankel tensors (Q2399200) (← links)
• Runge-Kutta-like scaling techniques for first-order methods in convex optimization (Q2400802) (← links)
• Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem (Q2403122) (← links)
• The modified accelerated Bregman method for regularized basis pursuit problem (Q2405606) (← links)
• Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization (Q2406313) (← links)
• Sparsity-promoting optimal control of systems with symmetries, consensus and synchronization networks (Q2407224) (← links)
• Cooperative concurrent asynchronous computation of the solution of symmetric linear systems (Q2407864) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• Sparse variational Bayesian approximations for nonlinear inverse problems: applications in nonlinear elastography (Q2414583) (← links)
• A descent Dai-Liao conjugate gradient method for nonlinear equations (Q2414704) (← links)
• Adaptive \(l_1\)-regularization for short-selling control in portfolio selection (Q2419515) (← links)
• Inexact alternating direction methods of multipliers for separable convex optimization (Q2419545) (← links)
• A semismooth Newton method for support vector classification and regression (Q2419554) (← links)
• The Uzawa-MBB type algorithm for nonsymmetric saddle point problems (Q2419575) (← links)
• Structured two-point stepsize gradient methods for nonlinear least squares (Q2420782) (← links)
• An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
• A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography (Q2422863) (← links)
• On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
• Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step (Q2423277) (← links)
• Composite SAR imaging using sequential joint sparsity (Q2424478) (← links)
• Sparsity reconstruction in electrical impedance tomography: an experimental evaluation (Q2428127) (← links)
• Shape optimization for tumor location (Q2429052) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
• Lifetime dependence modelling using a truncated multivariate gamma distribution (Q2443234) (← links)
• A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints (Q2450861) (← links)
• Gradient methods for computing the Drazin-inverse solution (Q2453197) (← links)
• Convergence of supermemory gradient method (Q2454990) (← links)
• An improved gradient projection-based decomposition technique for support vector machines (Q2468369) (← links)
• Scaled conjugate gradient algorithms for unconstrained optimization (Q2477015) (← links)
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
• On the asymptotic behaviour of some new gradient methods (Q2487845) (← links)
• On step-size estimation of line search methods (Q2489176) (← links)
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
• Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces (Q2492701) (← links)
• On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
• Spectral gradient projection method for solving nonlinear monotone equations (Q2503021) (← links)
• A new gradient method with an optimal stepsize property (Q2506170) (← links)
• Faster gradient descent and the efficient recovery of images (Q2510586) (← links)
• Successive unconstrained dual optimization method for~rank-one approximation to tensors (Q2510997) (← links)
• A globally optimal tri-vector method to solve an ill-posed linear system (Q2511179) (← links)
• Recovery of the local volatility function using regularization and a gradient projection method (Q2514665) (← links)
• Barzilai-Borwein-like methods for the extreme eigenvalue problem (Q2514702) (← links)
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)