IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming.
Comput. Optim. Appl., May, 2024
A Robust Fixed-Time Piecewise Dynamic Network for Convex Programming.
Neural Process. Lett., December, 2023
IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming.
J. Glob. Optim., November, 2023
A varying-parameter fixed-time gradient-based dynamic network for convex optimization.
Neural Networks, October, 2023
A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs.
Math. Methods Oper. Res., 2022
A gradient-type noise-tolerant finite-time neural network for convex optimization.
Neurocomputing, 2022
On the acceleration of the Barzilai-Borwein method.
Comput. Optim. Appl., 2022
Achieving geometric convergence for distributed optimization with Barzilai-Borwein step sizes.
Sci. China Inf. Sci., 2022