Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure

Yurii Nesterov
SIAM Journal on Optimization 31 (4) 2807 (2021)
https://doi.org/10.1137/20M134705X

Algorithms for Solving Common Fixed Point Problems

Alexander J. Zaslavski
Springer Optimization and Its Applications, Algorithms for Solving Common Fixed Point Problems 132 1 (2018)
https://doi.org/10.1007/978-3-319-77437-4_1

Numerical Optimization with Computational Errors

Alexander J. Zaslavski
Springer Optimization and Its Applications, Numerical Optimization with Computational Errors 108 149 (2016)
https://doi.org/10.1007/978-3-319-30921-7_10

Numerical Optimization with Computational Errors

Alexander J. Zaslavski
Springer Optimization and Its Applications, Numerical Optimization with Computational Errors 108 137 (2016)
https://doi.org/10.1007/978-3-319-30921-7_9

Numerical Optimization with Computational Errors

Alexander J. Zaslavski
Springer Optimization and Its Applications, Numerical Optimization with Computational Errors 108 1 (2016)
https://doi.org/10.1007/978-3-319-30921-7_1

Approximate Solutions of Common Fixed-Point Problems

Alexander J. Zaslavski
Springer Optimization and Its Applications, Approximate Solutions of Common Fixed-Point Problems 112 1 (2016)
https://doi.org/10.1007/978-3-319-33255-0_1

Numerical Optimization with Computational Errors

Alexander J. Zaslavski
Springer Optimization and Its Applications, Numerical Optimization with Computational Errors 108 169 (2016)
https://doi.org/10.1007/978-3-319-30921-7_11

Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function

Yu-Lin Chang, Jein-Shan Chen and Jia Wu
Journal of Industrial & Management Optimization 9 (1) 153 (2013)
https://doi.org/10.3934/jimo.2013.9.153

Strong Convergence of a General Iterative Algorithm for Mixed Equilibrium, Variational Inequality and Common Fixed Points Problems

Tanakit Thianwan
Advances in Pure Mathematics 03 (01) 83 (2013)
https://doi.org/10.4236/apm.2013.31011

A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors

Alexander J. Zaslavski
Nonlinear Analysis: Theory, Methods & Applications 75 (16) 6071 (2012)
https://doi.org/10.1016/j.na.2012.06.015

A proximal point algorithm for the monotone second-order cone complementarity problem

Jia Wu and Jein-Shan Chen
Computational Optimization and Applications 51 (3) 1037 (2012)
https://doi.org/10.1007/s10589-011-9399-x

Maximal Monotone Operators and the Proximal Point Algorithm in the Presence of Computational Errors

A. J. Zaslavski
Journal of Optimization Theory and Applications 150 (1) 20 (2011)
https://doi.org/10.1007/s10957-011-9820-8

Interior proximal methods and central paths for convex second-order cone programming

Shaohua Pan and Jein-Shan Chen
Nonlinear Analysis: Theory, Methods & Applications 73 (9) 3083 (2010)
https://doi.org/10.1016/j.na.2010.06.079

An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming

Jein-Shan Chen and Shaohua Pan
Computational Optimization and Applications 47 (3) 477 (2010)
https://doi.org/10.1007/s10589-008-9227-0

Ishikawa iterative algorithms for a generalized equilibrium problem and fixed point problems of a pseudo-contraction mapping

Jian-Wen Peng and Jen-Chih Yao
Journal of Global Optimization 46 (3) 331 (2010)
https://doi.org/10.1007/s10898-009-9428-9

Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces

Alexander J. Zaslavski
SIAM Journal on Optimization 20 (5) 2413 (2010)
https://doi.org/10.1137/090766930

A General Iterative Method for Variational Inequality Problems, Mixed Equilibrium Problems, and Fixed Point Problems of Strictly Pseudocontractive Mappings in Hilbert Spaces

Rattanaporn Wangkeeree and Rabian Wangkeeree
Fixed Point Theory and Applications 2009 (1) (2009)
https://doi.org/10.1155/2009/519065

Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems

Jian-Wen Peng and Jen-Chih Yao
Mathematical and Computer Modelling 49 (9-10) 1816 (2009)
https://doi.org/10.1016/j.mcm.2008.11.014

Strong convergence of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings

Rabian Wangkeeree and Rattanaporn Wangkeeree
Nonlinear Analysis: Hybrid Systems 3 (4) 719 (2009)
https://doi.org/10.1016/j.nahs.2009.06.009

Proximal-Like Algorithm Using the Quasi D-Function for Convex Second-Order Cone Programming

S. H. Pan and J. S. Chen
Journal of Optimization Theory and Applications 138 (1) 95 (2008)
https://doi.org/10.1007/s10957-008-9380-8

A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming

Shaohua Pan and Jein-Shan Chen
SIAM Journal on Optimization 19 (2) 883 (2008)
https://doi.org/10.1137/070685683

Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems

Jérôme Bolte and Marc Teboulle
SIAM Journal on Control and Optimization 42 (4) 1266 (2003)
https://doi.org/10.1137/S0363012902410861

Inherently Parallel Algorithms in Feasibility and Optimization and their Applications

Patrick L. Combettes
Studies in Computational Mathematics, Inherently Parallel Algorithms in Feasibility and Optimization and their Applications 8 115 (2001)
https://doi.org/10.1016/S1570-579X(01)80010-0

The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem

Nobuo Yamashita and Masao Fukushima
SIAM Journal on Optimization 11 (2) 364 (2000)
https://doi.org/10.1137/S105262349935949X

An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming

Moshe Doljansky and Marc Teboulle
SIAM Journal on Optimization 9 (1) 1 (1998)
https://doi.org/10.1137/S1052623496309405

Nonlinear rescaling and proximal-like methods in convex optimization

Roman Polyak and Marc Teboulle
Mathematical Programming 76 (2) 265 (1997)
https://doi.org/10.1007/BF02614440

Equilibrium programming using proximal-like algorithms

Sjur Didrik Flåm and Anatoly S. Antipin
Mathematical Programming 78 (1) 29 (1996)
https://doi.org/10.1007/BF02614504

An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities

Alfred Auslender and Mounir Haddou
Mathematical Programming 71 (1) 77 (1995)
https://doi.org/10.1007/BF01592246

Convergence of diagonally stationary sequences in convex optimization

M. A. Bahraoui and B. Lemaire
Set-Valued Analysis 2 (1-2) 49 (1994)
https://doi.org/10.1007/BF01027092

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

Gong Chen and Marc Teboulle
SIAM Journal on Optimization 3 (3) 538 (1993)
https://doi.org/10.1137/0803026