Pages that link to "Item:Q1610315"

The following pages link to Modified two-point stepsize gradient methods for unconstrained optimization (Q1610315):

Displaying 50 items.

• Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization (Q354621) (← links)
• Scaling on the spectral gradient method (Q368739) (← links)
• Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
• A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542) (← links)
• A new two-step gradient-type method for large-scale unconstrained optimization (Q604019) (← links)
• An improved multi-step gradient-type method for large scale optimization (Q640533) (← links)
• Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
• Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
• Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
• Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← 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)
• A new trust region method with adaptive radius (Q1029622) (← links)
• A descent algorithm without line search for unconstrained optimization (Q1044422) (← links)
• A new adaptive Barzilai and Borwein method for unconstrained optimization (Q1653281) (← links)
• A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
• An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization (Q1751056) (← links)
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
• A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems (Q1938001) (← links)
• Stochastic gradient method with Barzilai-Borwein step for unconstrained nonlinear optimization (Q1995392) (← links)
• The new spectral conjugate gradient method for large-scale unconstrained optimisation (Q2069403) (← links)
• The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation (Q2078458) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
• A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
• Accelerated diagonal gradient-type method for large-scale unconstrained optimization (Q2228737) (← links)
• A class of accelerated subspace minimization conjugate gradient methods (Q2231338) (← links)
• A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
• Nonmonotone adaptive trust region method with line search based on new diagonal updating (Q2261939) (← links)
• On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
• On sparse beamformer design with reverberation (Q2295315) (← links)
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
• A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
• Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization (Q2406313) (← 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 modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
• A trust region spectral method for large-scale systems of nonlinear equations (Q2629144) (← links)
• An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation (Q2666090) (← links)
• A modified secant equation quasi-Newton method for unconstrained optimization (Q2700102) (← links)
• Optimization-based shrinking dimer method for finding transition states (Q2790095) (← links)
• A modified two-point stepsize gradient algorithm for unconstrained minimization (Q2867423) (← links)
• A class of modified BFGS methods with function value information for unconstrained optimization (Q2873833) (← links)
• A new gradient method via least change secant update (Q2995480) (← links)
• A scaled nonlinear conjugate gradient algorithm for unconstrained optimization (Q3514834) (← links)
• Two-Point Step Size Gradient Methods (Q3779680) (← links)
• A spectral conjugate gradient method for nonlinear inverse problems (Q5240400) (← links)
• Gradient projection methods for quadratic programs and applications in training support vector machines (Q5317754) (← links)