The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Smoothing methods for nonsmooth, nonconvex minimization
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
Rockafellar, R. T., & Wets, R. J. B. (1998) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-02431-3 · Cited by 4,086
Nearly unbiased variable selection under minimax concave penalty
Zhang, C.-H. (2010) · The Annals of Statistics · doi:10.1214/09-aos729 · Cited by 3,835
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97544 · Cited by 3,521
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831050 · Cited by 2,895
The Linear Complementarity Problem
Cottle, R. W., Pang, J.-S., & Stone, R. E. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719000 · Cited by 2,788
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97543 · Cited by 2,289
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Introduction to Derivative-Free Optimization
Conn, A. R., Scheinberg, K., & Vicente, L. N. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718768 · Cited by 1,840
Chapter 36 Large sample estimation and hypothesis testing
Newey, W. K., & McFadden, D. (1994) · Handbook of Econometrics · doi:10.1016/s1573-4412(05)80005-4 · Cited by 1,743
(2006) · Optimal Control and Forecasting of Complex Dynamical Systems · doi:10.1142/9789812774248_0002 · Cited by 1,362
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Asymptotics for lasso-type estimators
Fu, W., & Knight, K. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957397 · Cited by 1,276
Constrained restoration and the recovery of discontinuities
Geman, D., & Reynolds, G. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.120331 · Cited by 1,085
Semismooth and Semiconvex Functions in Constrained Optimization
Mifflin, R. B. (1977) · SIAM Journal on Control and Optimization · doi:10.1137/0315061 · Cited by 817
A special newton-type optimization method
Fischer, A. (1992) · Optimization · doi:10.1080/02331939208843795 · Cited by 762
Methods of Descent for Nondifferentiable Optimization
Kiwiel, K. C. (1985) · Lecture notes in mathematics · doi:10.1007/bfb0074500 · Cited by 623
A class of smoothing functions for nonlinear and mixed complementarity problems
Chen, C., & Mangasarian, O. L. (1996) · Computational Optimization and Applications · doi:10.1007/bf00249052 · Cited by 505
Asymptotic properties of bridge estimators in sparse high-dimensional regression models
Huang, J., Horowitz, J. L., & Ma, S. (2008) · The Annals of Statistics · doi:10.1214/009053607000000875 · Cited by 482
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
Burke, J. V., Lewis, A. S., & Overton, M. L. (2005) · SIAM Journal on Optimization · doi:10.1137/030601296 · Cited by 453
Xu, Z., Zhang, H., Wang, Y., Chang, X., & Liang, Y. (2010) · Science China Information Sciences · doi:10.1007/s11432-010-0090-0 · Cited by 424
A group bridge approach for variable selection
Huang, J., Ma, S., Xie, H., & Zhang, C.-H. (2009) · Biometrika · doi:10.1093/biomet/asp020 · Cited by 324
Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
Chen, X., Xu, F., & Ye, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090761471 · Cited by 288
Self-citationSmoothing methods for convex inequalities and linear complementarity problems
Chen, C., & Mangasarian, O. L. (1995) · Mathematical Programming · doi:10.1007/bf01592244 · Cited by 277
Sample-path solution of stochastic variational inequalities
Gürkan, G., Yonca Özge, A., & Robinson, S. M. (1999) · Mathematical Programming · doi:10.1007/s101070050024 · Cited by 271
A note on the complexity of L p minimization
Ge, D., Jiang, X., & Ye, Y. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0470-2 · Cited by 254
Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem
Jiang, H., & Xu, H. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.925853 · Cited by 209
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
Nikolova, M., Ng, M. K., Zhang, S., & Ching, W.-K. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070692285 · Cited by 199
Lewis, A. S., & Overton, M. L. (1996) · Acta Numerica · doi:10.1017/s0962492900002646 · Cited by 190
Nikolova, M. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040619582 · Cited by 178
Complexity of unconstrained $$L_2-L_p$$ minimization
Chen, X., Ge, D., Wang, Z., & Ye, Y. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0613-0 · Cited by 158
Self-citationFukushima, M., Luo, Z.-Q. T., & Pang, J. (1998) · Computational Optimization and Applications · doi:10.1023/a:1018359900133 · Cited by 152
A smoothing-out technique for min—max optimization
Zang, I. (1980) · Mathematical Programming · doi:10.1007/bf01581628 · Cited by 141
Smoothing Technique and its Applications in Semidefinite Optimization
Nesterov, Y. E. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0001-8 · Cited by 140
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
Kiwiel, K. C. (2007) · SIAM Journal on Optimization · doi:10.1137/050639673 · Cited by 139
Chen, X., & Zhou, W. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/080740167 · Cited by 133
Self-citationRobust solution of monotone stochastic linear complementarity problems
Chen, X., Zhang, C., & Fukushima, M. (2007) · Mathematical Programming · doi:10.1007/s10107-007-0163-z · Cited by 126
Self-citationDescent methods for composite nondifferentiable optimization problems
Burke, J. V. (1985) · Mathematical Programming · doi:10.1007/bf01584377 · Cited by 119
Subgradient-Based Neural Networks for Nonsmooth Nonconvex Optimization Problems
Bian, W., & Xue, X. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2016340 · Cited by 119
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
Luo, Z.-Q. T., Pang, J., Ralph, D., & Wu, S. (1996) · Mathematical Programming · doi:10.1007/bf02592205 · Cited by 113
Hintermüller, M., & Wu, T. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/110854746 · Cited by 111
On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
Chen, X., & Ye, Y. (1999) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012997315907 · Cited by 101
Self-citationOptimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
Chen, X., Niu, L., & Yuan, Y. (2013) · SIAM Journal on Optimization · doi:10.1137/120871390 · Cited by 100
Self-citationZhang, C., & Chen, X. (2009) · SIAM Journal on Optimization · doi:10.1137/070702187 · Cited by 92
Self-citationStochastic $R_0$ Matrix Linear Complementarity Problems
Fang, H., Chen, X., & Fukushima, M. (2007) · SIAM Journal on Optimization · doi:10.1137/050630805 · Cited by 84
Self-citationStochastic Complementarity for Local Control of Discontinuous Dynamics
Tassa, Y., & Todorov, E. (2010) · Robotics: Science and Systems Conference · doi:10.15607/rss.2010.vi.022 · Cited by 74
How to deal with the unbounded in optimization: Theory and algorithms
Auslender, A. (1997) · Mathematical Programming · doi:10.1007/bf02614308 · Cited by 52
(1986) · RePEc: Research Papers in Economics
Cited by
A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update
Xu, Y., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0376-0 · Cited by 285
Metadata
- Authors
- Chen, X.
- Venue
- Mathematical Programming
- Published
- 2012-06-22
- Volume
- 134
- Issue
- 1
- Pages
- 71-99
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2098000549
- Cited by
- 295
- References
- 54
- FWCI
- 18.33
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.