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 15 items.
- Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex (Q510299) (← links)
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle (Q727222) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- 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)
- Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← 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)
- Accelerated gradient methods with absolute and relative noise in the gradient (Q6087056) (← links)
- Stochastic Saddle Point Problems with Decision-Dependent Distributions (Q6176418) (← 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)
