Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-018-9987-0
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- C. J. Lin & S. Lucidi & L. Palagi & A. Risi & M. Sciandrone, 2009. "Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 107-126, April.
- Paul Tseng & Sangwoon Yun, 2010. "A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training," Computational Optimization and Applications, Springer, vol. 47(2), pages 179-206, October.
- Giampaolo Liuzzi & Laura Palagi & Mauro Piacentini, 2010. "On the convergence of a Jacobi-type algorithm for Singly Linearly-Constrained Problems Subject to simple Bounds," DIS Technical Reports 2010-01, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
- Joachims, Thorsten, 1998. "Making large-scale SVM learning practical," Technical Reports 1998,28, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
- Chihwa Kao & Lung-fei Lee & Mark M. Pitt, 2001.
"Simulated Maximum Likelihood Estimation of the Linear Expenditure System with Binding Non-Negativity Constraints,"
Annals of Economics and Finance, Society for AEF, vol. 2(1), pages 215-235, May.
- Chihwa Kao & Lung-fei Lee & Mark M. Pitt, 2000. "Simulated Maximum Likelihood Estimation of the Linear Expenditure System with Binding Non-Negativity Constraints," CEMA Working Papers 50, China Economics and Management Academy, Central University of Finance and Economics, revised Apr 2001.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Andrea Cristofari, 2019. "An almost cyclic 2-coordinate descent method for singly linearly constrained problems," Computational Optimization and Applications, Springer, vol. 73(2), pages 411-452, June.
- Tommaso Colombo & Simone Sagratella, 2020. "Distributed algorithms for convex problems with linear coupling constraints," Journal of Global Optimization, Springer, vol. 77(1), pages 53-73, May.
- Valeria Ruggiero & Gerardo Toraldo, 2018. "Introduction to the special issue for SIMAI 2016," Computational Optimization and Applications, Springer, vol. 71(1), pages 1-3, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- C. J. Lin & S. Lucidi & L. Palagi & A. Risi & M. Sciandrone, 2009. "Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 107-126, April.
- Leonardo Galli & Alessandro Galligari & Marco Sciandrone, 2020. "A unified convergence framework for nonmonotone inexact decomposition methods," Computational Optimization and Applications, Springer, vol. 75(1), pages 113-144, January.
- Andrea Manno & Laura Palagi & Simone Sagratella, 2014. "A Class of Convergent Parallel Algorithms for SVMs Training," DIAG Technical Reports 2014-17, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Amir Beck, 2014. "The 2-Coordinate Descent Method for Solving Double-Sided Simplex Constrained Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(3), pages 892-919, September.
- Andrea Cristofari, 2019. "An almost cyclic 2-coordinate descent method for singly linearly constrained problems," Computational Optimization and Applications, Springer, vol. 73(2), pages 411-452, June.
- Ion Necoara & Andrei Patrascu, 2014. "A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints," Computational Optimization and Applications, Springer, vol. 57(2), pages 307-337, March.
- Giampaolo Liuzzi & Laura Palagi & Mauro Piacentini, 2010. "On the convergence of a Jacobi-type algorithm for Singly Linearly-Constrained Problems Subject to simple Bounds," DIS Technical Reports 2010-01, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Cassioli, A. & Di Lorenzo, D. & Sciandrone, M., 2013. "On the convergence of inexact block coordinate descent methods for constrained optimization," European Journal of Operational Research, Elsevier, vol. 231(2), pages 274-281.
- Hoang, Nam H. & Vu, Hai L. & Lo, Hong K., 2018. "An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 207-230.
- Daron Acemoglu & Asuman Ozdaglar, 2005.
"Competition and Efficiency in Congested Markets,"
NBER Working Papers
11201, National Bureau of Economic Research, Inc.
- Daron Acemoglu & Asuman E. Ozdaglar, 2005. "Competition and Efficiency in Congested Markets," Levine's Bibliography 172782000000000025, UCLA Department of Economics.
- Luca Zanni, 2006. "An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines," Computational Management Science, Springer, vol. 3(2), pages 131-145, April.
- Millimet, Daniel L. & Tchernis, Rusty, 2008. "Estimating high-dimensional demand systems in the presence of many binding non-negativity constraints," Journal of Econometrics, Elsevier, vol. 147(2), pages 384-395, December.
- Pofahl, Geoffrey M. & Capps, Oral, Jr. & Clauson, Annette L., 2005. "Demand for Non-Alcoholic Beverages: Evidence From The ACNielsen Home Scan Panel," 2005 Annual meeting, July 24-27, Providence, RI 19441, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
- E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
- Raimondo, Roberto, 2020. "Pathwise smooth splittable congestion games and inefficiency," Journal of Mathematical Economics, Elsevier, vol. 86(C), pages 15-23.
- Gur, Yonatan & Iancu, Dan & Warnes, Xavier, 2020. "Value Loss in Allocation Systems with Provider Guarantees," Research Papers 3813, Stanford University, Graduate School of Business.
- Peng Han & Xinyue Yang & Yifei Zhao & Xiangmin Guan & Shengjie Wang, 2022. "Quantitative Ground Risk Assessment for Urban Logistical Unmanned Aerial Vehicle (UAV) Based on Bayesian Network," Sustainability, MDPI, vol. 14(9), pages 1-13, May.
- Thomas, Alban & Chakir, Raja, 2020.
"Unintended consequences of environmental policies: the case of set-aside and agricultural intensification,"
TSE Working Papers
20-1066, Toulouse School of Economics (TSE).
- Raja Chakir & Alban Thomas, 2022. "Unintended Consequences of Environmental Policies: the Case of Set-aside and Agricultural Intensification [Conséquences involontaires des politiques environnementales : le cas du gel des terres et ," Post-Print hal-03550528, HAL.
- Raja Chakir & Alban Thomas, 2020. "Unintended consequences of environmental policies: the case of set-aside and agricultural intensification," Working Papers hal-02482207, HAL.
- Morales, Dolores Romero & Vermeulen, Dries, 2009. "Existence of equilibria in a decentralized two-level supply chain," European Journal of Operational Research, Elsevier, vol. 197(2), pages 642-658, September.
- Weizhe Gu & Wei-Po Chen & Chun-Hsu Ko & Yuh-Jye Lee & Jein-Shan Chen, 2018. "Two smooth support vector machines for $$\varepsilon $$ ε -insensitive regression," Computational Optimization and Applications, Springer, vol. 70(1), pages 171-199, May.
More about this item
Keywords
Decomposition algorithm; Big data; Support vector machines; Parallel computing;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:71:y:2018:i:1:d:10.1007_s10589-018-9987-0. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.