Pages that link to "Item:Q4639139"
From MaRDI portal
The following pages link to An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem (Q4639139):
Displaying 13 items.
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization (Q2132432) (← links)
- A delayed weighted gradient method for strictly convex quadratic minimization (Q2282816) (← links)
- Accelerated augmented Lagrangian method for total variation minimization (Q2322436) (← links)
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods (Q2330648) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization (Q2672727) (← links)
- A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization (Q2691343) (← links)
- An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization (Q5104613) (← links)
- A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization (Q6593314) (← links)
- Cyclic gradient methods for unconstrained optimization (Q6601975) (← links)
- New gradient methods with adaptive stepsizes by approximate models (Q6611221) (← links)
