| Publication | Date of Publication | Type |
|---|
"Randomized Nystr\""om Preconditioned Interior Point-Proximal Method of Multipliers"
(available as arXiv preprint) | N/A | Paper |
Constructing magic squares: an integer constraint satisfaction problem and a fast approach
Computational and Applied Mathematics | 2026-07-07 | Paper |
Randomized Nyström preconditioned interior point-proximal method of multipliers
SIAM Journal on Scientific Computing | 2026-01-09 | Paper |
A finitely convergent circumcenter method for the convex feasibility problem
SIAM Journal on Optimization | 2024-07-29 | Paper |
On the centralization of the circumcentered-reflection method
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
A successive centralized circumcentered-reflection method for the convex feasibility problem
Computational Optimization and Applications | 2024-01-18 | Paper |
| A finitely convergent circumcenter method for the Convex Feasibility Problem | 2023-08-18 | Paper |
Circumcentric directions of cones
Optimization Letters | 2023-05-04 | Paper |
First-order methods for the convex hull membership problem
European Journal of Operational Research | 2022-12-19 | Paper |
Circumcentering approximate reflections for solving the convex feasibility problem
Fixed Point Theory and Algorithms for Sciences and Engineering | 2022-05-12 | Paper |
| A circumcentered-reflection method for finding common fixed points of firmly nonexpansive operators | 2022-03-04 | Paper |
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
SIAM Journal on Optimization | 2021-12-01 | Paper |
First-order methods for the convex hull membership problem
(available as arXiv preprint) | 2021-11-15 | Paper |
The circumcentered-reflection method achieves better rates than alternating projections
Computational Optimization and Applications | 2021-08-09 | Paper |
Circumcentering approximate reflections for solving the convex feasibility problem
(available as arXiv preprint) | 2021-05-02 | Paper |
On the circumcentered-reflection method for the convex feasibility problem
Numerical Algorithms | 2021-04-07 | Paper |
Infeasibility and error bound imply finite convergence of alternating projections
(available as arXiv preprint) | 2020-08-07 | Paper |
The block-wise circumcentered-reflection method
Computational Optimization and Applications | 2020-06-26 | Paper |
Towards an efficient augmented Lagrangian method for convex quadratic programming
Computational Optimization and Applications | 2020-06-26 | Paper |
Optimized choice of parameters in interior-point methods for linear programming
Computational Optimization and Applications | 2019-06-13 | Paper |
On the linear convergence of the circumcentered-reflection method
Operations Research Letters | 2019-06-11 | Paper |
Circumcentering the Douglas-Rachford method
Numerical Algorithms | 2018-07-16 | Paper |
On the linear convergence of the circumcentered-reflection method
(available as arXiv preprint) | 2017-11-23 | Paper |
