Name
Title | ||
|---|---|---|
A smoothing SQP framework for a class of composite $$L_q$$Lq minimization over polyhedron |
Abstract | ||
|---|---|---|
The composite $$L_q~(0 |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10107-015-0939-5 | Mathematical Programming: Series A and B |
Keywords | Field | DocType |
Composite L-q minimization,epsilon-KKT point,Nonsmooth nonconvex non-Lipschitzian optimization,Optimality condition,Smoothing approximation,Worst-case iteration complexity | Mathematical optimization,Polyhedron,Regular polygon,Smoothing,Minification,Quadratic programming,Karush–Kuhn–Tucker conditions,Sequential quadratic programming,Signal reconstruction,Mathematics | Journal |
Volume | Issue | ISSN |
158 | 1-2 | 0025-5610 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. F. Liu | 1 | 454 | 30.59 |
| Shiqian Ma | 2 | 1068 | 63.48 |
| Yu-Hong Dai | 3 | 1079 | 78.67 |
| Shuzhong Zhang | 4 | 2808 | 181.66 |