Pages that link to "Item:Q1035898"

The following pages link to Subgradient methods for saddle-point problems (Q1035898):

Displaying 50 items.

• Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
• Online learning over a decentralized network through ADMM (Q259131) (← links)
• Dual averaging with adaptive random projection for solving evolving distributed optimization problems (Q306393) (← links)
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
• Primal-dual algorithm for distributed constrained optimization (Q325079) (← links)
• Distributed design of approximately optimal controller for identical discrete-time multi-agent systems (Q328206) (← links)
• Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
• Distributed convergence to Nash equilibria in two-network zero-sum games (Q522807) (← links)
• Distributed stochastic subgradient projection algorithms for convex optimization (Q620442) (← links)
• Stability of primal-dual gradient dynamics and applications to network optimization (Q624939) (← links)
• Distributed multi-agent optimization with state-dependent communication (Q644903) (← links)
• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
• Convergence rate for consensus with delays (Q989893) (← links)
• On Poljak's improved subgradient method (Q1090617) (← links)
• On the emergence of oscillations in distributed resource allocation (Q1679826) (← links)
• Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients (Q1717855) (← links)
• An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians (Q1955564) (← links)
• A golden ratio primal-dual algorithm for structured convex optimization (Q2025858) (← links)
• A stochastic primal-dual method for optimization with conditional value at risk constraints (Q2046691) (← links)
• Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
• A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis (Q2146528) (← links)
• The saddle point problem of polynomials (Q2162120) (← links)
• Linear convergence of primal-dual gradient methods and their performance in distributed optimization (Q2184550) (← links)
• Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
• Saddle points of rational functions (Q2307710) (← links)
• Primal-dual stochastic distributed algorithm for constrained convex optimization (Q2334189) (← links)
• Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
• A hierarchical algorithm for vehicle-to-grid integration under line capacity constraints (Q2415115) (← links)
• A two-phase algorithm for a variational inequality formulation of equilibrium problems (Q2442699) (← links)
• Distributed consensus-based solver for semi-definite programming: an optimization viewpoint (Q2665375) (← links)
• Saddle-Point Dynamics: Conditions for Asymptotic Stability of Saddle Points (Q2968544) (← links)
• Stochastic Recursive Inclusions in Two Timescales with Nonadditive Iterate-Dependent Markov Noise (Q3387930) (← links)
• Splitting subspaces and saddle points (Q4291836) (← links)
• A Projection-Based Decomposition Algorithm for Distributed Fast Computation of Control in Microgrids (Q4604631) (← links)
• Distributed Bregman-Distance Algorithms for Min-Max Optimization (Q5023087) (← links)
• Data-driven distributionally robust risk parity portfolio optimization (Q5058398) (← links)
• Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
• Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
• Golden Ratio Primal-Dual Algorithm with Linesearch (Q5093645) (← links)
• First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
• On the Role of a Market Maker in Networked Cournot Competition (Q5108233) (← links)
• Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints (Q5114401) (← links)
• Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
• Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems (Q5139836) (← links)
• DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS (Q5174338) (← links)
• A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks (Q5206938) (← links)
• Abstract convergence theorem for quasi-convex optimization problems with applications (Q5228820) (← links)
• Distributed primal–dual stochastic subgradient algorithms for multi‐agent optimization under inequality constraints (Q5409133) (← links)
• A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs (Q5737727) (← links)