Pages that link to "Item:Q4090967"
From MaRDI portal
The following pages link to On the Goldstein-Levitin-Polyak gradient projection method (Q4090967):
Displayed 10 items.
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming (Q5502239) (← links)
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework (Q5860343) (← links)
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities (Q5959904) (← links)
- Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
- A gradient descent method for estimating the Markov chain choice model (Q6097386) (← links)
- Optimal Control of the Landau–de Gennes Model of Nematic Liquid Crystals (Q6135090) (← links)
- Quasi non-negative quaternion matrix factorization with application to color face recognition (Q6159019) (← links)
- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem (Q6164562) (← links)
- Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
- Machine learning based iterative learning control for non‐repetitive time‐varying systems (Q6190208) (← links)