269 results on '"Deren Han"'
Search Results
2. Alternating Direction Method of Multipliers for Sparse and Low-Rank Decomposition Based on Nonconvex Nonsmooth Weighted Nuclear Norm
3. A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems.
4. Scalable Relaxation Two-Sweep Modulus-Based Matrix Splitting Methods for Vertical LCP.
5. On Adaptive Stochastic Heavy Ball Momentum for Solving Linear Systems.
6. Randomized Douglas-Rachford Methods for Linear Systems: Improved Accuracy and Efficiency.
7. Optimal parameter of the SOR-like iteration method for solving absolute value equations.
8. Stochastic alternating structure-adapted proximal gradient descent method with variance reduction for nonconvex nonsmooth optimization.
9. Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks.
10. Self-Adaptive Implicit Methods for Monotone Variant Variational Inequalities
11. An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction.
12. A simple linear convergence analysis of the reshuffling Kaczmarz method.
13. Novel clustered federated learning based on local loss.
14. A Momentum Accelerated Algorithm for ReLU-based Nonlinear Matrix Decomposition.
15. Non-convex Pose Graph Optimization in SLAM via Proximal Linearized Riemannian ADMM.
16. Randomized iterative methods for generalized absolute value equations: Solvability and error bounds.
17. A class of maximum-based iteration methods for the generalized absolute value equation.
18. On adaptive stochastic extended iterative methods for solving least squares.
19. A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity.
20. Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems.
21. Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems.
22. Accelerated Doubly Stochastic Gradient Descent for Tensor CP Decomposition.
23. An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization.
24. An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant.
25. A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis.
26. Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications.
27. The neural network models with delays for solving absolute value equations.
28. Correction to: Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks.
29. A Partially Inertial Customized Douglas-Rachford Splitting Method for a Class of Structured Optimization Problems.
30. An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems.
31. The neural network models with delays for solving absolute value equations.
32. The linear convergence of the greedy randomized Kaczmarz method is deterministic.
33. Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization.
34. On greedy multi-step inertial randomized Kaczmarz method for solving linear systems.
35. Approximate first-order primal-dual algorithms for saddle point problems.
36. Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems.
37. Randomized mechanism design for decentralized network scheduling.
38. Solving a Class of Variational Inequality Problems with a New Inexact Strategy.
39. Solving policy design problems: Alternating direction method of multipliers-based methods for structured inverse variational inequalities.
40. A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems.
41. On finite termination of the generalized Newton method for solving absolute value equations.
42. Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems.
43. A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
44. A tri-level optimization model for a private road competition problem with traffic equilibrium constraints.
45. Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes.
46. A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations.
47. A class of inexact modified Newton-type iteration methods for solving the generalized absolute value equations.
48. An inexact Douglas-Rachford splitting method for solving absolute value equations.
49. Optimal parameter for the SOR-like iteration method for solving the system of absolute value equations.
50. An operator splitting method for monotone variational inequalities with a new perturbation strategy.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.