Pages that link to "Item:Q2313241"
From MaRDI portal
The following pages link to Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems (Q2313241):
Displaying 13 items.
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
- Stochastic saddle-point optimization for the Wasserstein barycenter problem (Q2162697) (← links)
- Alternating minimization methods for strongly convex optimization (Q2232092) (← links)
- Numerical methods for the resource allocation problem in a computer network (Q2662812) (← links)
- Composite optimization for the resource allocation problem (Q5085260) (← links)
- Generalized Momentum-Based Methods: A Hamiltonian Perspective (Q5857293) (← links)
- Inexact model: a framework for optimization and variational inequalities (Q5865338) (← links)
- Universal intermediate gradient method for convex problems with inexact oracle (Q5865342) (← links)
- Nesterov's Method for Convex Optimization (Q6046292) (← links)
- Radial duality. II: Applications and algorithms (Q6126645) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems (Q6601206) (← links)
- Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods (Q6644994) (← links)
