Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Search content at Experts@Minnesota
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
An interior-point based subgradient method for nondifferentiable convex optimization
J. B G Frenk
, J. F. Sturm
,
S. Zhang
Industrial and Systems Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An interior-point based subgradient method for nondifferentiable convex optimization'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Point-based
100%
Interior Point
100%
Subgradient Method
100%
Nonsmooth Convex Optimization
100%
Minimax Problem
66%
Minimax
33%
Interior Point Method
33%
Search Direction
33%
Subgradient
33%
Convex Programming Problem
33%
Affine Scaling Method
33%
Convergence of the Method
33%
Logarithmic Barrier
33%
Mathematics
Interior Point
100%
Subgradient
100%
Convex
100%
Min-Max
50%
Objective Function
25%
Minimax
25%
Convex Programming Problem
25%
Search Direction
25%