Subgradient methods for saddle-point problems
From MaRDI portal
Recommendations
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Subgradient methods for saddle point problems of quasiconvex optimization
- A two-level subgradient method for finding saddle points of convex- concave functions
- Combined subgradient methods for finding saddle points
- Primal-dual subgradient methods for convex problems
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 4167867 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Convergence of some algorithms for convex minimization
- Convergence rate of incremental subgradient algorithms
- Ergodic convergence in subgradient optimization
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Incremental subgradient methods for nondifferentiable optimization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Large-scale convex optimization via saddle point computation
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Primal-dual subgradient methods for convex problems
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- The mathematics of internet congestion control
- What is the Subdifferential of the Closed Convex Hull of a Function?
Cited in
(75)- The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- Subgradient methods for saddle point problems of quasiconvex optimization
- A distributed ADMM-like method for resource sharing over time-varying networks
- Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Robust Accelerated Primal-Dual Methods for Computing Saddle Points
- Golden ratio primal-dual algorithm with linesearch
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- The saddle point problem of polynomials
- Online learning over a decentralized network through ADMM
- Alleviating limit cycling in training GANs with an optimization technique
- Duality and sensitivity analysis of multistage linear stochastic programs
- Online first-order framework for robust convex optimization
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- Strong convergence of the regularized operator extrapolation algorithm for variational inequalities
- Subgradient ellipsoid method for nonsmooth convex problems
- Distributed convergence to Nash equilibria in two-network zero-sum games
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- On the Role of a Market Maker in Networked Cournot Competition
- Splitting subspaces and saddle points
- Local saddle points for unconstrained polynomial optimization
- A differentially private distributed optimization method for constrained optimization
- Distributed Bregman-distance algorithms for min-max optimization
- Data-driven distributionally robust risk parity portfolio optimization
- Saddle points of rational functions
- Linear convergence of primal-dual gradient methods and their performance in distributed optimization
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed multi-agent optimization with state-dependent communication
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
- Accelerated stochastic algorithms for convex-concave saddle-point problems
- Two-timescale recurrent neural networks for distributed minimax optimization
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- A primal-dual algorithm for nonnegative N-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis
- A golden ratio primal-dual algorithm for structured convex optimization
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
- First-order methods for problems with \(O(1)\) functional constraints can have almost the same convergence rate as for unconstrained problems
- Primal convergence from dual subgradient methods for convex optimization
- Primal-dual algorithm for distributed constrained optimization
- Distributed design of approximately optimal controller for identical discrete-time multi-agent systems
- A projection-based decomposition algorithm for distributed fast computation of control in microgrids
- Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games
- Distributed consensus-based solver for semi-definite programming: an optimization viewpoint
- A stochastic primal-dual method for optimization with conditional value at risk constraints
- Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- On Poljak's improved subgradient method
- On the emergence of oscillations in distributed resource allocation
- Utility/privacy trade-off as regularized optimal transport
- Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Stochastic approximation for estimating the price of stability in stochastic Nash games
- Convergence rate for consensus with delays
- Subgradient method for nonconvex nonsmooth optimization
- Stability of primal-dual gradient dynamics and applications to network optimization
- A two-phase algorithm for a variational inequality formulation of equilibrium problems
- Saddle-point dynamics: conditions for asymptotic stability of saddle points
- Convergence rates of subgradient methods for quasi-convex optimization problems
- An inexact primal-dual algorithm for semi-infinite programming
- Stochastic Recursive Inclusions in Two Timescales with Nonadditive Iterate-Dependent Markov Noise
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- Primal-dual \(\varepsilon\)-subgradient method for distributed optimization
- Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
- A hierarchical algorithm for vehicle-to-grid integration under line capacity constraints
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- Achieving zero constraint violation for concave utility constrained reinforcement learning via primal-dual approach
- Subgradient algorithm for computing contraction metrics for equilibria
- Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
- Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds
- Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
This page was built for publication: Subgradient methods for saddle-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035898)
