Skip to main navigation
Skip to search
Skip to main content
Arizona State University Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Datasets
Prizes
Search by expertise, name or affiliation
Subgradient methods for saddle-point problems
A. Nedić
, A. Ozdaglar
Research output
:
Contribution to journal
›
Article
›
peer-review
317
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Subgradient methods for saddle-point problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Subgradient Method
100%
Saddle Point Problems
87%
Saddlepoint
56%
Lagrangian Function
48%
Subgradient
44%
Network Protocols
33%
Lagrangian Duality
27%
Networking
26%
Primal-dual Method
25%
Dual Method
24%
Dual Solutions
24%
Decentralized
23%
Constraint Qualifications
21%
Primal-dual
21%
Concave function
20%
Dual Problem
19%
Estimate
16%
Convex function
15%
Optimal Solution
15%
Convergence Rate
15%
Objective function
15%
Approximate Solution
14%
Rate of Convergence
14%
Optimization Problem
13%
Iteration
11%
Computing
11%
Design
11%
Business & Economics
Saddlepoint
99%
Dual Problem
26%
Convex Optimization
26%
Convergence Rate
24%
Rate of Convergence
22%
Networking
22%
Duality
19%
Qualification
19%
Violations
17%
Objective Function
17%
Optimization Problem
16%
Optimal Solution
16%
Engineering & Materials Science
Convex optimization
15%
Network protocols
10%