Approximating zeros of monotone operators by proximal point algorithms
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-009-9410-6
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.References listed on IDEAS
- M. V. Solodov & B. F. Svaiter, 2000. "An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 214-230, May.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Siwaporn Saewan & Poom Kumam & Yeol Cho, 2013. "Strong convergence for maximal monotone operators, relatively quasi-nonexpansive mappings, variational inequalities and equilibrium problems," Journal of Global Optimization, Springer, vol. 57(4), pages 1299-1318, December.
- Ali Abkar & Moosa Gabeleh, 2013. "Best proximity points of non-self mappings," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 287-295, July.
- Lan, Heng-you, 2021. "Approximation-solvability of population biology systems based on p-Laplacian elliptic inequalities with demicontinuous strongly pseudo-contractive operators," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).
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.- Maicon Marques Alves & Samara Costa Lima, 2017. "An Inexact Spingarn’s Partial Inverse Method with Applications to Operator Splitting and Composite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 175(3), pages 818-847, December.
- William W. Hager & Hongchao Zhang, 2020. "Convergence rates for an inexact ADMM applied to separable convex optimization," Computational Optimization and Applications, Springer, vol. 77(3), pages 729-754, December.
- Jianchao Bai & Miao Zhang & Hongchao Zhang, 2025. "An inexact ADMM for separable nonconvex and nonsmooth optimization," Computational Optimization and Applications, Springer, vol. 90(2), pages 445-479, March.
- Ceng, Lu-Chuan & Yao, Jen-Chih, 2007. "Approximate proximal methods in vector optimization," European Journal of Operational Research, Elsevier, vol. 183(1), pages 1-19, November.
- Lu-Chuan Ceng & Nicolas Hadjisavvas & Ngai-Ching Wong, 2010. "Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems," Journal of Global Optimization, Springer, vol. 46(4), pages 635-646, April.
- Papa Quiroz, E.A. & Mallma Ramirez, L. & Oliveira, P.R., 2015. "An inexact proximal method for quasiconvex minimization," European Journal of Operational Research, Elsevier, vol. 246(3), pages 721-729.
- Renato D. C. Monteiro & Chee-Khian Sim, 2018. "Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operators," Computational Optimization and Applications, Springer, vol. 70(3), pages 763-790, July.
- Balendu Bhooshan Upadhyay & Subham Poddar & Jen-Chih Yao & Xiaopeng Zhao, 2025. "Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials," Annals of Operations Research, Springer, vol. 345(1), pages 417-466, February.
- William W. Hager & Hongchao Zhang, 2019. "Inexact alternating direction methods of multipliers for separable convex optimization," Computational Optimization and Applications, Springer, vol. 73(1), pages 201-235, May.
- Jonathan Eckstein & Wang Yao, 2017. "Approximate ADMM algorithms derived from Lagrangian splitting," Computational Optimization and Applications, Springer, vol. 68(2), pages 363-405, November.
- Lei Yang & Kim-Chuan Toh, 2026. "Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 686-714, January.
- Pourya Behmandpoor & Puya Latafat & Andreas Themelis & Marc Moonen & Panagiotis Patrinos, 2024. "SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization," Computational Optimization and Applications, Springer, vol. 88(1), pages 71-106, May.
- Souza, Sissy da S. & Oliveira, P.R. & da Cruz Neto, J.X. & Soubeyran, A., 2010. "A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant," European Journal of Operational Research, Elsevier, vol. 201(2), pages 365-376, March.
- Nils Langenberg, 2012. "An Interior Proximal Method for a Class of Quasimonotone Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 902-922, December.
- Jonathan Eckstein & Paulo Silva, 2010. "Proximal methods for nonlinear programming: double regularization and inexact subproblems," Computational Optimization and Applications, Springer, vol. 46(2), pages 279-304, June.
- Jiaxin Xie, 2018. "On inexact ADMMs with relative error criteria," Computational Optimization and Applications, Springer, vol. 71(3), pages 743-765, December.
- Yunfei Qu & Xingju Cai & Hongying Liu & Deren Han, 2025. "Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming," Computational Optimization and Applications, Springer, vol. 91(3), pages 1227-1261, July.
- L. C. Ceng & B. S. Mordukhovich & J. C. Yao, 2010. "Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 267-303, August.
- Nils Langenberg, 2015. "Interior Proximal Method Without the Cutting Plane Property," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 529-557, August.
- M. Marques Alves & Dirk A. Lorenz & Emanuele Naldi, 2026. "A general framework for inexact splitting algorithms with relative errors and applications to Chambolle–Pock and Davis–Yin methods," Computational Optimization and Applications, Springer, vol. 93(2), pages 729-763, March.
More about this item
Keywords
; ; ; ; ; ; ; ;JEL classification:
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:46:y:2010:i:1:p:75-87. 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.
Printed from https://ideas.repec.org/a/spr/jglopt/v46y2010i1p75-87.html