| A simplified proof of weak convergence in Douglas-Rachford method | 0 | 0.34 | 2019 |
| A Further Study on Asymptotic Functions via Variational Analysis | 0 | 0.34 | 2019 |
| The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous. | 2 | 0.36 | 2018 |
| A Variant of the Hybrid Proximal Extragradient Method for Solving Strongly Monotone Inclusions and its Complexity Analysis. | 0 | 0.34 | 2016 |
| Algebraic rules for computing the regularization parameter of the Levenberg–Marquardt method | 0 | 0.34 | 2016 |
| An adaptive accelerated first-order method for convex optimization | 8 | 0.66 | 2016 |
| Algebraic rules for quadratic regularization of Newton's method | 5 | 0.48 | 2015 |
| On the behaviour of constrained optimization methods when Lagrange multipliers do not exist | 2 | 0.45 | 2014 |
| A first-order block-decomposition method for solving two-easy-block structured semidefinite programs. | 4 | 0.49 | 2014 |
| A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance | 4 | 0.41 | 2012 |
| Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems | 27 | 1.39 | 2011 |
| Weber-Fechner Law and the Optimality of the Logarithmic Scale | 5 | 0.57 | 2011 |
| A Continuous Dynamical Newton-Like Approach to Solving Monotone Inclusions | 4 | 0.64 | 2011 |
| On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean | 37 | 2.20 | 2010 |
| Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians | 6 | 0.44 | 2010 |
| A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences | 23 | 1.14 | 2010 |
| Analytic center of spherical shells and its application to analytic center machine | 0 | 0.34 | 2009 |
| General Projective Splitting Methods for Sums of Maximal Monotone Operators | 32 | 3.23 | 2009 |
| Newton's Method for Multiobjective Optimization | 51 | 2.37 | 2009 |
| Kantorovich's majorants principle for Newton's method | 21 | 2.01 | 2009 |
| A computational model for telomere-dependent cell-replicative aging | 0 | 0.34 | 2008 |
| A family of projective splitting methods for the sum of two maximal monotone operators | 21 | 3.06 | 2008 |
| On the choice of parameters for the weighting method in vector optimization | 12 | 0.83 | 2008 |
| An Outer Approximation Method for the Variational Inequality Problem | 11 | 1.30 | 2005 |
| Inexact Variants of the Proximal Point Algorithm without Monotonicity | 13 | 1.87 | 2003 |
| Kantorovich's theorem on Newton's method in Riemannian Manifolds | 35 | 2.93 | 2002 |
| A New Proximal-Based Globalization Strategy for the Josephy-Newton Method for Variational Inequalities | 2 | 0.42 | 2002 |
| A Relative Error Tolerance for a Family of Generalized Proximal Point Methods | 9 | 0.60 | 2001 |
| On the need for hybrid steps in hybrid proximal point methods | 1 | 0.36 | 2001 |
| Steepest Descent Methods for Multicriteria Optimization | 80 | 6.03 | 2000 |
| On the central path for nonlinear semidefinite programming | 2 | 0.38 | 2000 |
| Error bounds for proximal point subproblems and associated inexact proximal point algorithms | 35 | 2.58 | 2000 |
| An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions | 41 | 5.93 | 2000 |
| Forcing strong convergence of proximal point iterations in a Hilbert space | 39 | 10.29 | 2000 |
| A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem | 18 | 2.87 | 2000 |
| A row-action method for convex programming | 4 | 1.84 | 1994 |
| Entropy-Like Proximal Methods in Convex Programming | 54 | 12.58 | 1994 |
