Inexact proximal $$\epsilon $$ϵ-subgradient methods for composite convex optimization problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-019-00808-8
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
- J. Y. Bello Cruz & R. Díaz Millán, 2016. "A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces," Journal of Global Optimization, Springer, vol. 65(3), pages 597-614, July.
- Andrea Simonetto & Hadi Jamali-Rad, 2016. "Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 172-197, January.
- NESTEROV, Yurii, 2013. "Gradient methods for minimizing composite functions," LIDAM Reprints CORE 2510, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- J. Y. Bello Cruz & R. Díaz Millán, 2014. "A Direct Splitting Method for Nonsmooth Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 728-737, June.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Yunier Bello-Cruz & Max L. N. Gonçalves & Nathan Krislock, 2023. "On FISTA with a relative error rule," Computational Optimization and Applications, Springer, vol. 84(2), pages 295-318, March.
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.- Kaiwen Ma & Nikolaos V. Sahinidis & Sreekanth Rajagopalan & Satyajith Amaran & Scott J Bury, 2021. "Decomposition in derivative-free optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 269-292, October.
- Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
- A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
- Ren Jiang & Zhifeng Ji & Wuling Mo & Suhua Wang & Mingjun Zhang & Wei Yin & Zhen Wang & Yaping Lin & Xueke Wang & Umar Ashraf, 2022. "A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir," Energies, MDPI, vol. 15(19), pages 1-20, September.
- Zhaosong Lu & Xiaojun Chen, 2018. "Generalized Conjugate Gradient Methods for ℓ 1 Regularized Convex Quadratic Programming with Finite Convergence," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 275-303, February.
- Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
- TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016.
"Exact worst-case performance of first-order methods for composite convex optimization,"
LIDAM Discussion Papers CORE
2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Adrien B. TAYLOR & Julien M. HENDRICKX & François GLINEUR, 2017. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Reprints CORE 2875, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Masoud Ahookhosh, 2019. "Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 319-353, June.
- Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
- Dewei Zhang & Yin Liu & Sam Davanloo Tajbakhsh, 2022. "A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1126-1140, March.
- Weibin Mo & Yufeng Liu, 2022. "Efficient learning of optimal individualized treatment rules for heteroscedastic or misspecified treatment‐free effect models," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 440-472, April.
- Liu, Yulan & Bi, Shujun, 2019. "Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 418-435.
- Sun, Shilin & Wang, Tianyang & Yang, Hongxing & Chu, Fulei, 2022. "Damage identification of wind turbine blades using an adaptive method for compressive beamforming based on the generalized minimax-concave penalty function," Renewable Energy, Elsevier, vol. 181(C), pages 59-70.
- Saif Eddin Jabari & Nikolaos M. Freris & Deepthi Mary Dilip, 2020. "Sparse Travel Time Estimation from Streaming Data," Transportation Science, INFORMS, vol. 54(1), pages 1-20, January.
- Haitian Liu & Subhonmesh Bose & Hoa Dinh Nguyen & Ye Guo & Thinh T. Doan & Carolyn L. Beck, 2024. "Distributed Dual Subgradient Methods with Averaging and Applications to Grid Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1991-2024, November.
- Ching-pei Lee & Stephen J. Wright, 2019. "Inexact Successive quadratic approximation for regularized optimization," Computational Optimization and Applications, Springer, vol. 72(3), pages 641-674, April.
- Xin He & Nan-jing Huang & Xue-song Li, 2022. "Modified Projection Methods for Solving Multi-valued Variational Inequality without Monotonicity," Networks and Spatial Economics, Springer, vol. 22(2), pages 361-377, June.
- Le Thi Khanh Hien & Cuong V. Nguyen & Huan Xu & Canyi Lu & Jiashi Feng, 2019. "Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 541-566, May.
- Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
- Min Li & Xiaoming Yuan, 2015. "A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 842-858, October.
More about this item
Keywords
Splitting methods; Optimization problem; $$epsilon $$ ϵ -Subdifferential; Inexact methods; Hilbert space; Accelerated methods;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:jglopt:v:75:y:2019:i:4:d:10.1007_s10898-019-00808-8. 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.