462
Views
14
CrossRef citations to date
0
Altmetric
Optimization with Penalization

Minimizing Sum of Truncated Convex Functions and Its Applications

& ORCID Icon
Pages 1-10 | Received 01 Oct 2016, Published online: 05 Jun 2018

References

  • Agarwal, A., and Daumé III, H. (2011), “Generative Kernels for Exponential Families,” in Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, Brookline, MA: Microtome Publishing, pp. 85–92.
  • An, L. T. H., and Tao, P. D. (1997), “Solving a Class of Linearly Constrained Indefinite Quadratic Problems by DC Algorithms,” Journal of Global Optimization, 11, 253–285.
  • Barequet, G., Dickerson, M., and Pau, P. (1997), “Translating a Convex Polygon to Contain a Maximum Number of Points,” Computational Geometry, 8, 167–179.
  • Boyd, S., and Vandenberghe, L. (2004), Convex Optimization, Cambridge, UK: Cambridge University Press.
  • Candès, E. J., and Tao, T. (2010), “The Power of Convex Relaxation: Near-Optimal Matrix Completion,” IEEE Transactions on Information Theory, 56, 2053–2080.
  • Chazelle, B. M., and Lee, D.-T. (1986), “On a Circle Placement Problem,” Computing, 36, 1–16.
  • Chen, G., Zeng, D., and Kosorok, M. R. (2016), “Personalized Dose Finding Using Outcome Weighted Learning,” Journal of the American Statistical Association, 111, 1509–1521.
  • Cook, S. A. (1971), “The Complexity of Theorem-Proving Procedures,” in ACM Proceedings of the Third Annual ACM Symposium on Theory of Computing, New York, Association for Computing Machinery, pp. 151–158.
  • de Berg, M., van Kreveld, M., Overmars, M., and Schwarzkopf, O. C. (2000), Computational Geometry, Berlin, Heidelberg: Springer, pp. 1–17.
  • Eddelbuettel, D., and François, R. (2011), “Rcpp: Seamless R and C++ Integration,” Journal of Statistical Software, 40, 1–18.
  • Fan, J., and Li, R. (2001), “Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties,” Journal of the American Statistical Association, 96, 1348–1360.
  • Gannaz, I. (2007), “Robust Estimation and Wavelet Thresholding in Partially Linear Models,” Statistics and Computing, 17, 293–310.
  • Georgogiannis, A. (2016), “Robust k-means: A Theoretical Revisit,” in Advances in Neural Information Processing Systems, ed. D.D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, Red Hook, NY: Curran Associates, pp. 2883–2891.
  • Gervini, D., and Yohai, V. J. (2002), “A Class of Robust and Fully Efficient Regression Estimators,” Annals of Statistics, 30, 583–616.
  • Hendrix, E. M., and Boglárka, G. (2010), Introduction to Nonlinear and Global Optimization, New York: Springer.
  • Jiang, H., and Salzman, J. (2015), “A Penalized Likelihood Approach for Robust Estimation of Isoform Expression,” Statistics and Its Interface, 8, 437–445.
  • Jiang, H., and Zhan, T. (2017), “Unit-Free and Robust Detection of Differential Expression from RNA-Seq Data,” Statistics in Biosciences, 9, 178–199.
  • Jones, D. R., Perttunen, C. D., and Stuckman, B. E. (1993), “Lipschitzian Optimization without the Lipschitz Constant,” Journal of Optimization Theory and Applications, 79, 157–181.
  • Karp, R. M. (1972), “Reducibility among Combinatorial Problems,” in Complexity of Computer Computations. The IBM Research Symposia Series, ed. R. E. Miller, J. W. Thatcher, and J. D. Bohlinger, Boston, MA: Springer.
  • Katayama, S., and Fujisawa, H. (2017), “Sparse and Robust Linear Regression: An Optimization Algorithm and its Statistical Properties,” Statistica Sinica, 27, 1243–1264.
  • Lee, Y., MacEachern, S. N., and Jung, Y. (2012), “Regularization of Case-Specific Parameters for Robustness and Efficiency,” Statistical Science, 27, 350–372.
  • Madsen, K., and Zertchaninov, S. (1998), A New Branch-and-Bound Method for Global Optimization, IMM, Department of Mathematical Modelling, Technical University of Denmark.
  • Maronna, R., Martin, D., and Yohai, V. (2006), Robust Statistics, Chichester: Wiley.
  • McCann, L., and Welsch, R. E. (2007), “Robust Variable Selection using Least Angle Regression and Elemental Set Sampling,” Computational Statistics & Data Analysis, 52, 249–257.
  • Mehrez, A., and Stulman, A. (1982), “The Maximal Covering Location Problem with Facility Placement on the Entire Plane,” Journal of Regional Science, 22, 361–365.
  • Michael, R. G., and David, S. J. (1979), Computers and Intractability: A Guide to the Theory of NP-completeness, San Francisco, CA: WH Free. Co.
  • Nasrabadi, N. M., Tran, T. D., and Nguyen, N. (2011), “Robust Lasso With Missing and Grossly Corrupted Observations,” in Proceedings of the Advances in Neural Information Processing Systems, Red Hook, NY: Curran Associates, pp. 1881–1889.
  • Nikolova, M. (2000), “Thresholding Implied by Truncated Quadratic Regularization,” IEEE Transactions on Signal Processing, 48, 3437–3450.
  • ——— (2011), “Energy Minimization Methods,” in Handbook of Mathematical Methods in Imaging, ed. O. Scherzer, New York: Springer, pp. 139–185.
  • Nikolova, M., Ng, M. K., and Tam, C.-P. (2010), “Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction,” IEEE Transactions on Image Processing, 19, 3073–3088.
  • Portilla, J., Tristán-Vega, A., and Selesnick, I. W. (2015), “Efficient and Robust Image Restoration using Multiple-Feature L2-relaxed Sparse Analysis Priors,” IEEE Transactions on Image Processing, 24, 5046–5059.
  • R Core Team (2017), R: A Language and Environment for Statistical Computing, Vienna, Austria: R Foundation for Statistical Computing.
  • Richter-Gebert, J. (2011), Perspectives on Projective Geometry: A Guided Tour Through Real and Complex Geometry, Berlin, Heidelberg: Springer Science & Business Media.
  • Rosseeuw, P. J., and Leroy, A. M. (1987), Robust Regression and Outlier Detection, Wiley Series in Probability and Mathematical Statistics, New York: Wiley, 1.
  • She, Y., and Owen, A. B. (2011), “Outlier Detection Using Nonconvex Penalized Regression,” Journal of the American Statistical Association, 106, 626–639.
  • Shen, X., Pan, W., and Zhu, Y. (2012), “Likelihood-Based Selection and Sharp Parameter Estimation,” Journal of the American Statistical Association, 107, 223–232.
  • Tibshirani, J., and Manning, C. D. (2014), “Robust Logistic Regression Using Shift Parameters,” in Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, Stroudsburg, PA: ACL, pp. 124–129.
  • Wilcox, R. R. (2005), “Robust Testing Procedures,” in Encyclopedia of Statistics in Behavioral Science, ed. B. Everitt and D. Howell, Hoboken, NJ: John Wiley & Sons.
  • Witten, D. M. (2013), “Penalized Unsupervised Learning with Outliers,” Statistics and its Interface, 6, 211.
  • Xiang, Y., Gubian, S., Suomela, B., and Hoeng, J. (2013), “Generalized Simulated Annealing for Global Optimization: The GenSA Package,” R Journal, 5, 13–28.
  • Yohai, V. J. (1987), “High Breakdown-Point and High Efficiency Robust Estimates for Regression,” The Annals of Statistics, 15, 642–656.
  • Zambrano-Bigiarini, M., and Rojas, R. (2013), “A Model-Independent Particle Swarm Optimisation Software for Model Calibration,” Environmental Modelling & Software, 43, 5–25.
  • Zhigljavsky, A., and Žilinskas, A. (2007), Stochastic Global Optimization, vol. 9, New York: Springer Science & Business Media.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.