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
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Search by expertise, name or affiliation
Conic convex programming and self-dual embedding
Z. Q. Luo
, J. F. Sturm
,
S. Zhang
Electrical and Computer Engineering
Industrial and Systems Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
59
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Conic convex programming and self-dual embedding'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Linear Programming
100%
Self-dual
100%
Convex Programming
100%
Self-dual Embedding
100%
Semidefinite Programming
66%
Original Problem
66%
Dual Problem
66%
Initialization Problems
66%
Optimization Problem
33%
Todd
33%
Problem-based
33%
Interior Point Method
33%
Embedding Method
33%
Simplex Method
33%
Initialize
33%
Convex Programming Problem
33%
Dual System
33%
No-analog
33%
Strict Complementarity
33%
Two-phase Approach
33%
Big-M
33%
Computer Science
Convex Programming
100%
Linear Programming
100%
Semidefinite Programming
66%
Dual Problem
66%
Optimization Problem
33%
Interior-Point Method
33%
Simplex
33%
Mathematics
Convex Programming
100%
Linear Programming
100%
Dual Problem
66%
Concludes
33%
Interior Point
33%
Convex Programming Problem
33%
Simplex Method
33%
Dual System
33%