Deren Han

Orcid: 0000-0002-0427-8224

According to our database1, Deren Han authored at least 90 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

A Momentum Accelerated Algorithm for ReLU-based Nonlinear Matrix Decomposition.
CoRR, 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
Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems.
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

Accelerated Doubly Stochastic Gradient Descent for Tensor CP Decomposition.
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

The neural network models with delays for solving absolute value equations.
CoRR, 2023

On greedy multi-step inertial randomized Kaczmarz method for solving linear systems.
CoRR, 2023

Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization.
CoRR, 2023

The linear convergence of the greedy randomized Kaczmarz method is deterministic.
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
Approximate first-order primal-dual algorithms for saddle point problems.
Math. Comput., 2021

Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems.
J. Optim. Theory Appl., 2021

An extended proximal ADMM algorithm for three-block nonconvex optimization problems.
J. Comput. Appl. Math., 2021

A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations.
CoRR, 2021

Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes.
CoRR, 2021

A class of inexact modified Newton-type iteration methods for solving the generalized absolute value equations.
CoRR, 2021

An inexact Douglas-Rachford splitting method for solving absolute value equations.
CoRR, 2021

2020
Randomized mechanism design for decentralized network scheduling.
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

Solving a Class of Variational Inequality Problems with a New Inexact Strategy.
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

Comparison of several fast algorithms for projection onto an ellipsoid.
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

A class of nonlinear proximal point algorithms for variational inequality problems.
Int. J. Comput. Math., 2015

A fast splitting method tailored for Dantzig selector.
Comput. Optim. Appl., 2015

Cross-Hill: A heuristic method for global optimization.
Appl. Math. Comput., 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

A Parallel Splitting Method for Separable Convex Programs.
J. Optim. Theory Appl., 2013

An improved first-order primal-dual algorithm with a new correction step.
J. Glob. Optim., 2013

An ADM-based splitting method for separable convex programming.
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
A New Decomposition Method for Variational Inequalities with Linear Constraints.
J. Optim. Theory Appl., 2012

A Note on the Alternating Direction Method of Multipliers.
J. Optim. Theory Appl., 2012

Some projection methods with the BB step sizes for variational inequalities.
J. Comput. Appl. Math., 2012

Efficient neural networks for solving variational inequalities.
Neurocomputing, 2012

An improved two-step method for solving generalized Nash equilibrium problems.
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
Solving a class of variational inequalities with inexact oracle operators.
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
A new alternating direction method for co-coercive variational inequality problems.
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
Extreme diffusion values for non-Gaussian diffusions.
Optim. Methods Softw., 2008

An operator splitting method for variational inequalities with partially unknown mappings.
Numerische Mathematik, 2008

The toll effect on price of anarchy when costs are nonlinear and asymmetric.
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

Solving linear variational inequality problems by a self-adaptive projection method.
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
A feasible descent algorithm for solving variational inequality problems.
Math. Methods Oper. Res., 2003

A New Hybrid Generalized Proximal Point Algorithm for Variational Inequality Problems.
J. Glob. Optim., 2003

2002
A new inexact alternating directions method for monotone variational inequalities.
Math. Program., 2002

A new stepsize rule in He and Zhou's alternating direction method.
Appl. Math. Lett., 2002

2000
A new modified extra-gradient method for variational inequality problems.
Neural Parallel Sci. Comput., 2000


  Loading...