Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Press/Media
Datasets
Activities
Fellowships, Honors, and Prizes
Search by expertise, name or affiliation
A deep cut ellipsoid algorithm for convex programming: Theory and applications
J. B G Frenk, J. Gromicho,
S. Zhang
Industrial and Systems Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
11
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A deep cut ellipsoid algorithm for convex programming: Theory and applications'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Ellipsoid Algorithm
100%
Convex Programming
69%
Numerical Instability
20%
Convex Program
19%
Location Problem
17%
Min-max
16%
Queue
15%
Computational Results
15%
Rate of Convergence
11%
Class
9%
Engineering & Materials Science
Programming theory
95%
Convex optimization
65%