Skip to main navigation
Skip to search
Skip to main content
Penn State Home
Help & FAQ
Home
Researchers
Research output
Research units
Equipment
Grants & Projects
Prizes
Activities
Search by expertise, name or affiliation
Global solutions to folded concave penalized nonconvex learning
Hongcheng Liu, Tao Yao,
Runze Li
Marcus Department of Industrial and Manufacturing Engineering
Institute for Computational and Data Sciences (ICDS)
Center for Interdisciplinary Mathematics
Statistics
Department of Public Health Sciences
Penn State Cancer Institute
Cancer Institute, Cancer Control
Research output
:
Contribution to journal
›
Article
›
peer-review
22
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Global solutions to folded concave penalized nonconvex learning'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Global Solution
100%
Non-convex Learning
100%
Global Optimization
75%
Statist
50%
Learning Problems
50%
Mixed Integer Programming
50%
Numerical Results
25%
Optimization Techniques
25%
Optimization Scheme
25%
Statistical Properties
25%
Local Linear Approximation
25%
Solution Quality
25%
Global Optimal Solution
25%
Mixed Integer Linear Programming
25%
Solution Technique
25%
Quadratic Program
25%
Solution Scheme
25%
Folded Concave Penalty
25%
Mathematics
Global Solution
100%
Integer Programming
100%
Integer
50%
Optimality
50%
Statistical Property
50%
Linear Approximation
50%
Quadratic Programming
50%
Computer Science
Global Optimization
100%
Learning Problem
66%
Mixed Integer Programming
66%
Optimization Technique
33%
Approximation (Algorithm)
33%
Solution Quality
33%
Statistical Property
33%
Mixed-Integer Linear Programming
33%
Global Optimal Solution
33%
Earth and Planetary Sciences
Quadratic Programming
100%