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
Random algorithms for convex minimization problems
Angelia Nedić
Research output
:
Contribution to journal
›
Article
›
peer-review
77
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Random algorithms for convex minimization problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Convex Minimization
100%
Minimization Problem
75%
Differentiable
29%
Diminishing
28%
Weighted Average
26%
Objective function
19%
Subgradient Method
15%
Constrained Minimization
13%
Almost Sure Convergence
13%
Gradient Method
12%
Constrained Optimization Problem
12%
Level Set
11%
Iterate
11%
Value Function
10%
Error Bounds
10%
Optimal Solution
9%
Optimality
9%
Lipschitz
9%
Gradient
8%
Intersection
8%
Observation
7%
Iteration
7%
Engineering & Materials Science
Set theory
25%
Gradient methods
24%
Constrained optimization
21%