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
64
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
Almost Sure Convergence
13%
Constrained Minimization
13%
Constrained Optimization Problem
12%
Convex Minimization
100%
Differentiable
29%
Diminishing
28%
Error Bounds
10%
Gradient
8%
Gradient Method
12%
Intersection
8%
Iterate
11%
Iteration
7%
Level Set
11%
Lipschitz
9%
Minimization Problem
75%
Objective function
19%
Observation
7%
Optimal Solution
9%
Optimality
9%
Subgradient Method
15%
Value Function
10%
Weighted Average
26%
Engineering & Materials Science
Constrained optimization
21%
Gradient methods
24%
Set theory
25%