Pages that link to "Item:Q4965105"
From MaRDI portal
The following pages link to Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem (Q4965105):
Displaying 9 items.
- Noisy zeroth-order optimization for non-smooth saddle point problems (Q2104286) (← links)
- One-point gradient-free methods for smooth and non-smooth saddle-point problems (Q2117626) (← links)
- Improved exploitation of higher order smoothness in derivative-free optimization (Q2162687) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact (Q6060544) (← links)
- Zeroth-order single-loop algorithms for nonconvex-linear minimax problems (Q6064036) (← links)
- Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems (Q6550978) (← links)
- General procedure to provide high-probability guarantees for stochastic saddle point problems (Q6569676) (← links)
- Stochastic adversarial noise in the ``black box'' optimization problem (Q6588731) (← links)