Deren Han
Orcid: 0000-0002-0427-8224
According to our database1,
Deren Han
authored at least 106 papers
between 2000 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
J. Sci. Comput., April, 2025
2024
Scalable Relaxation Two-Sweep Modulus-Based Matrix Splitting Methods for Vertical LCP.
J. Optim. Theory Appl., October, 2024
Optimal parameter of the SOR-like iteration method for solving absolute value equations.
Numer. Algorithms, June, 2024
Correction to: Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks.
Math. Methods Oper. Res., April, 2024
Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks.
Math. Methods Oper. Res., April, 2024
Randomized Douglas-Rachford Methods for Linear Systems: Improved Accuracy and Efficiency.
SIAM J. Optim., March, 2024
Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications.
J. Comput. Appl. Math., February, 2024
A Partially Inertial Customized Douglas-Rachford Splitting Method for a Class of Structured Optimization Problems.
J. Sci. Comput., January, 2024
SIAM J. Matrix Anal. Appl., 2024
Stochastic alternating structure-adapted proximal gradient descent method with variance reduction for nonconvex nonsmooth optimization.
Math. Comput., 2024
Neurocomputing, 2024
SOR-like iteration and FPI are consistent when they are equipped with certain optimal iterative parameters.
CoRR, 2024
An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction.
CoRR, 2024
CoRR, 2024
Randomized iterative methods for generalized absolute value equations: Solvability and error bounds.
CoRR, 2024
CoRR, 2024
CoRR, 2024
A class of maximum-based iteration methods for the generalized absolute value equation.
Appl. Math. Lett., 2024
A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Numer. Algorithms, November, 2023
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis.
J. Glob. Optim., November, 2023
An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization.
J. Glob. Optim., November, 2023
A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity.
Optim. Methods Softw., September, 2023
Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems.
Numer. Algorithms, September, 2023
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant.
J. Glob. Optim., September, 2023
J. Optim. Theory Appl., May, 2023
Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems.
J. Comput. Appl. Math., 2023
CoRR, 2023
Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization.
CoRR, 2023
CoRR, 2023
2022
An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems.
Math. Methods Oper. Res., 2022
On finite termination of the generalized Newton method for solving absolute value equations.
CoRR, 2022
2021
Math. Comput., 2021
Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems.
J. Optim. Theory Appl., 2021
J. Comput. Appl. Math., 2021
A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations.
CoRR, 2021
CoRR, 2021
A class of inexact modified Newton-type iteration methods for solving the generalized absolute value equations.
CoRR, 2021
CoRR, 2021
2020
Optim. Methods Softw., 2020
A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems.
J. Glob. Optim., 2020
Solving policy design problems: Alternating direction method of multipliers-based methods for structured inverse variational inequalities.
Eur. J. Oper. Res., 2020
Optimal parameter for the SOR-like iteration method for solving the system of absolute value equations.
CoRR, 2020
Asia Pac. J. Oper. Res., 2020
2019
A tri-level optimization model for a private road competition problem with traffic equilibrium constraints.
Eur. J. Oper. Res., 2019
2018
An operator splitting method for monotone variational inequalities with a new perturbation strategy.
Optim. Lett., 2018
Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming.
Math. Oper. Res., 2018
An Accelerated Three-Term Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition.
J. Optim. Theory Appl., 2018
A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions.
J. Glob. Optim., 2018
Alternating Direction Method of Multipliers for Sparse and Low-Rank Decomposition Based on Nonconvex Nonsmooth Weighted Nuclear Norm.
IEEE Access, 2018
2017
Convergence Analysis of Douglas-Rachford Splitting Method for "Strongly + Weakly" Convex Programming.
SIAM J. Numer. Anal., 2017
A sequential updating scheme of the Lagrange multiplier for separable convex programming.
Math. Comput., 2017
J. Comput. Appl. Math., 2017
Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints.
Int. J. Comput. Math., 2017
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function.
Comput. Optim. Appl., 2017
A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems.
Asia Pac. J. Oper. Res., 2017
2016
Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems.
SIAM J. Numer. Anal., 2016
Fiber Orientation Distribution Estimation Using a Peaceman-Rachford Splitting Method.
SIAM J. Imaging Sci., 2016
A distributed Douglas-Rachford splitting method for multi-block convex minimization problems.
Adv. Comput. Math., 2016
2015
A Partial Splitting Augmented Lagrangian Method for Low Patch-Rank Image Decomposition.
J. Math. Imaging Vis., 2015
Int. J. Comput. Math., 2015
2014
A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints.
Numerische Mathematik, 2014
An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing.
Math. Comput., 2014
A proximal parallel splitting method for minimizing sum of convex functions with linear constraints.
J. Comput. Appl. Math., 2014
2013
Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs.
SIAM J. Numer. Anal., 2013
Positive Semidefinite Generalized Diffusion Tensor Imaging via Quadratic Semidefinite Programming.
SIAM J. Imaging Sci., 2013
A hybrid splitting method for variational inequality problems with separable structure.
Optim. Methods Softw., 2013
J. Optim. Theory Appl., 2013
J. Glob. Optim., 2013
Comput. Optim. Appl., 2013
A Progressive equilibration Algorithm for General Market equilibrium Problems under Constraints.
Asia Pac. J. Oper. Res., 2013
A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions.
Appl. Math. Comput., 2013
2012
J. Optim. Theory Appl., 2012
J. Optim. Theory Appl., 2012
J. Comput. Appl. Math., 2012
Eur. J. Oper. Res., 2012
An efficient simultaneous method for the constrained multiple-sets split feasibility problem.
Comput. Optim. Appl., 2012
2011
New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions.
IEEE Trans. Signal Process., 2011
2010
Math. Methods Oper. Res., 2010
The efficiency analysis for oligopolistic games when cost functions are non-separable.
Int. J. Math. Model. Numer. Optimisation, 2010
2009
Comput. Math. Appl., 2009
A modified projection method with a new direction for solving variational inequalities.
Appl. Math. Comput., 2009
Sequential Experimental Approach for Congestion Pricing with Multiple Vehicle Types and Multiple Time Periods.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009
2008
An operator splitting method for variational inequalities with partially unknown mappings.
Numerische Mathematik, 2008
Eur. J. Oper. Res., 2008
A self-adaptive projection method with improved step-size for solving variational inequalities.
Comput. Math. Appl., 2008
On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands.
Comput. Math. Appl., 2008
A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems.
Comput. Math. Appl., 2008
2007
A simple self-adaptive alternating direction method for linear variational inequality problems.
Comput. Math. Appl., 2007
An extended alternating direction method for variational inequality problems with linear equality and inequality constraints.
Appl. Math. Comput., 2007
2006
A new class of projection and contraction methods for solving variational inequality problems.
Comput. Math. Appl., 2006
Appl. Math. Comput., 2006
2004
Solving Variational Inequality Problems with Linear Constraints by a Proximal Decomposition Algorithm.
J. Glob. Optim., 2004
Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities.
Eur. J. Oper. Res., 2004
2003
Math. Methods Oper. Res., 2003
A New Hybrid Generalized Proximal Point Algorithm for Variational Inequality Problems.
J. Glob. Optim., 2003
2002
Math. Program., 2002
Appl. Math. Lett., 2002
2000
Neural Parallel Sci. Comput., 2000