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 modified bat algorithm with conjugate gradient method for global optimization (Q779965) (← links)
- Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
- A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics (Q785497) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems (Q827565) (← links)
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules (Q837553) (← links)
- Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions (Q839683) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- New inexact line search method for unconstrained optimization (Q850832) (← links)
- Gradient methods with adaptive step-sizes (Q853675) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations (Q882583) (← links)
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae (Q887119) (← links)
- Numerical methods for parameter estimation in Poisson data inversion (Q890095) (← links)
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
- A new steplength selection for scaled gradient methods with application to image deblurring (Q897119) (← links)
- An accelerated double step size model in unconstrained optimization (Q902839) (← links)
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm (Q925253) (← links)
- A derivative-free nonmonotone line-search technique for unconstrained optimization (Q935796) (← links)
- Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
- Some remarks on conjugate gradient methods without line search (Q945376) (← links)
- Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods (Q962312) (← links)
- A globally convergent derivative-free method for solving large-scale nonlinear monotone equations (Q966075) (← links)
- A PRP type method for systems of monotone equations (Q969837) (← links)
- Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration (Q993545) (← links)
- An affine-scaling interior-point CBB method for box-constrained optimization (Q1013965) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- A new gradient method via quasi-Cauchy relation which guarantees descent (Q1026455) (← links)
- Greatest descent algorithms in unconstrained optimization (Q1035932) (← links)
- A descent algorithm without line search for unconstrained optimization (Q1044422) (← links)
- Smooth and adaptive gradient method with retards (Q1410678) (← links)
- Flow search approach and new bounds for the \(m\)-step linear conjugate gradient algorithm (Q1431700) (← links)
- Linear reconstruction problems with convex constraints: Influence of the a priori data (Q1569190) (← links)
- Modified two-point stepsize gradient methods for unconstrained optimization (Q1610315) (← links)
- Biorthogonal vector sequence transformations and Padé approximation of vector series (Q1612430) (← links)
- A residual algorithm for finding a fixed point of a nonexpansive mapping (Q1615317) (← links)
- Numerical methods for high-dimensional kinetic equations (Q1627226) (← links)
- A convergent least-squares regularized blind deconvolution approach (Q1636832) (← links)
- Comparison of minimization methods for nonsmooth image segmentation (Q1642276) (← links)
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
- A new adaptive Barzilai and Borwein method for unconstrained optimization (Q1653281) (← links)
- A residual approach for balanced truncation model reduction (BTMR) of compartmental systems (Q1653934) (← links)
- Simulation of the oxygen distribution in a tumor tissue using residual algorithms (Q1653944) (← links)
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction (Q1653953) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- Derivative-free method for bound constrained nonlinear monotone equations and its application in solving steady state reaction-diffusion problems (Q1653962) (← links)
- A positive spectral gradient-like method for large-scale nonlinear monotone equations (Q1653975) (← links)