Stochastic approximation algorithm for minimax problems
From MaRDI portal
A stochastic approximation algorithm for minimax optimization problems is analyzed. At each iterate, it performs one random experiment, based on which it computes a direction vector. It is shown that, under suitable conditions, it a.s. converges to the set of points satisfying necessary optimality conditions. The algorithm and its analysis bring together ideas from stochastic approximation and nondifferentiable optimization.
Recommendations
- Rates of convergence of semi-stochastic approximation procedures for solving stochastic optimization problems
- Stochastic methods for solving minimax problems
- Convergence Analysis of Stochastic Algorithms
- A nonlinear Lagrange algorithm for stochastic minimax problems based on sample average approximation method
- A stochastic steepest-descent algorithm
Cites work
- A Stochastic Approximation Method
- Generalized Gradients and Applications
- scientific article; zbMATH DE number 4086905 (Why is no real title available?)
- scientific article; zbMATH DE number 3459735 (Why is no real title available?)
- scientific article; zbMATH DE number 3496814 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimization and nonsmooth analysis
- Stochastic approximation methods for constrained and unconstrained systems
- Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
Cited in
(31)- Stochastic algorithm for minimization of an additive function
- A stochastic steepest-descent algorithm
- A stochastic approximation counterpart of the feasible direction method
- Interchangeability of expectation and differentiation of waiting times in GI/G/1 queues
- Stochastic algorithms with Armijo stepsizes for minimization of functions
- Stochastic approximation of global minimum points
- A nonlinear Lagrange algorithm for stochastic minimax problems based on sample average approximation method
- Stochastic methods based on \(\mathcal{VU}\)-decomposition methods for stochastic convex minimax problems
- Optimal convergence rate of the randomized algorithms of stochastic approximation in arbitrary noise
- Extremal problems with rare events. II: Method of successive random approximations
- Algorithms for the solution of stochastic dynamic minimax problems
- Analysis of search methods of optimization based on potential theory. I: Nonlocal properties
- Analysis of search methods of optimization based on potential theory. III: Convergence of methods
- SABRINA: a stochastic subspace majorization-minimization algorithm
- Algorithm for stochastic approximation with trial input perturbation in the nonstationary problem of optimization
- Stochastic methods for solving minimax problems
- scientific article; zbMATH DE number 4164555 (Why is no real title available?)
- scientific article; zbMATH DE number 3901529 (Why is no real title available?)
- Rates of convergence of semi-stochastic approximation procedures for solving stochastic optimization problems
- scientific article; zbMATH DE number 4091202 (Why is no real title available?)
- Stochastic recursive algorithms for optimization. Simultaneous perturbation methods
- scientific article; zbMATH DE number 1555182 (Why is no real title available?)
- A Globally Convergent Stochastic Approximation
- scientific article; zbMATH DE number 10634 (Why is no real title available?)
- Convergence Analysis of Stochastic Algorithms
- A Stochastic Approximation Algorithm with Varying Bounds
- The stochastic auxiliary problem principle in Banach spaces: measurability and convergence
- Minimization theorems and techniques for sequential stochastic machines
- Minimization algorithms based on supervisor and searcher cooperation
- Asymptotic normality and optimality in nonsmooth stochastic approximation
- Stochastic approximation search algorithms with randomization at the input
This page was built for publication: Stochastic approximation algorithm for minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823151)
