Neil D. Dizon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Neil D. Dizon has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Jeffrey A. Hogan
Department of Mathematics, School of Computer and Information Sciences, University of Newcastle
7 shared publications - Vaithilingam Jeyakumar
Department of Applied Mathematics, University of New South Wales, Sydney, Australia
7 shared publications - Guoyin Li
Department of Applied Mathematics, University of New South Wales, Sydney, Australia
4 shared publications - Queenie Yingkun Huang
Department of Applied Mathematics, University of New South Wales, Sydney, Australia
3 shared publications - Scott Boivin Lindstrom
Curtin University
3 shared publications - Matthew K. Tam
School of Mathematics & Statistics The University of Melbourne Australia
2 shared publications
Latest Publications
- Open Access
- 29 October 2026
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 95 (1) , 1
Primal-Dual Proximal Splitting for Wasserstein Distributionally Robust Convex Semidefinite Optimization via SDP-Based Spectrahedral Projection
We present a primal-dual proximal splitting framework for solving a broad class of convex semidefinite optimization problems with distributionally robust constraints involving piecewise affine functions, spectrahedral support sets, and Wasserstein ambiguity, which arise in a broad range of applications. We develop a semidefinite programming (SDP)-based formula for computing the projection onto a spectrahedron enabling the integration of SDP techniques within a primal-dual splitting framework for solving these problems via finite-dimensional convex semidefinite optimization reformulations. By reformulating the distributionally robust constraints into a system of linear matrix inequalities, we express the original distributionally robust problem as a finite-dimensional convex problem which results in convex composite unconstrained optimization problems suitable for primal-dual projection algorithms. Finally, we demonstrate the computational tractability of the proposed framework through numerical experiments on two representative models: mean-risk portfolio optimization with transaction costs in finance, and binary classification in machine learning. The results reveal that the primal-dual algorithm effectively solves the models of moderate scale.
- 29 October 2026
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 95 (1) , 1
Open AccessPrimal-Dual Proximal Splitting for Wasserstein Distributionally Robust Convex Semidefinite Optimization via SDP-Based Spectrahedral Projection
We present a primal-dual proximal splitting framework for solving a broad class of convex semidefinite optimization problems with distributionally robust constraints involving piecewise affine functions, spectrahedral support sets, and Wasserstein ambiguity, which arise in a broad range of applications. We develop a semidefinite programming (SDP)-based formula for computing the projection onto a spectrahedron enabling the integration of SDP techniques within a primal-dual splitting framework for solving these problems via finite-dimensional convex semidefinite optimization reformulations. By reformulating the distributionally robust constraints into a system of linear matrix inequalities, we express the original distributionally robust problem as a finite-dimensional convex problem which results in convex composite unconstrained optimization problems suitable for primal-dual projection algorithms. Finally, we demonstrate the computational tractability of the proposed framework through numerical experiments on two representative models: mean-risk portfolio optimization with transaction costs in finance, and binary classification in machine learning. The results reveal that the primal-dual algorithm effectively solves the models of moderate scale.
- Open Access
- 28 July 2026
- Published by Springer Nature in Optimization Letters
- p. 1-38
Characterization and recovery of optimal distributions in Wasserstein expectation problems with non-convex quadratic functions via single SDP
We consider the minimization of the expectation of piecewise (not necessarily convex) quadratic function over Wasserstein balls. This expectation problem often appears as a key sub-problem of distributionally robust optimization problems. We present a computationally accessible semidefinite program (SDP)-based characterization for the optimal distribution of this problem, requiring only the optimal solution of a single SDP. We show that strong duality holds between the expectation problem and its SDP dual problem. We then provide a constructive characterization of the associated optimal distributions and prove that they can be explicitly recovered from an optimal solution of the dual of the dual SDP. This result enables the direct computation of the optimal distributions of the expectation problem. Furthermore, we demonstrate through a numerical study on a distributionally robust mean-risk portfolio optimization problem using simulated data that the worst-case distributions can be computed efficiently and utilized to obtain probabilistic interpretation of worst-case solutions.
- 28 July 2026
- Published by Springer Nature in Optimization Letters
- p. 1-38
Open AccessCharacterization and recovery of optimal distributions in Wasserstein expectation problems with non-convex quadratic functions via single SDP
We consider the minimization of the expectation of piecewise (not necessarily convex) quadratic function over Wasserstein balls. This expectation problem often appears as a key sub-problem of distributionally robust optimization problems. We present a computationally accessible semidefinite program (SDP)-based characterization for the optimal distribution of this problem, requiring only the optimal solution of a single SDP. We show that strong duality holds between the expectation problem and its SDP dual problem. We then provide a constructive characterization of the associated optimal distributions and prove that they can be explicitly recovered from an optimal solution of the dual of the dual SDP. This result enables the direct computation of the optimal distributions of the expectation problem. Furthermore, we demonstrate through a numerical study on a distributionally robust mean-risk portfolio optimization problem using simulated data that the worst-case distributions can be computed efficiently and utilized to obtain probabilistic interpretation of worst-case solutions.
- Open Access
- 17 June 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 490-509
Piecewise sum-of-squares convexity and Wasserstein distributionally robust optimization: Exact semi-definite programming reformulations with data-driven decision-making under uncertainty
- 17 June 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 490-509
Open AccessPiecewise sum-of-squares convexity and Wasserstein distributionally robust optimization: Exact semi-definite programming reformulations with data-driven decision-making under uncertainty
- Open Access
- 8 May 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 209 (2) , 61
Convergent Lifted Lasserre Hierarchy of SDPs for Minimizing Expectation of Piecewise Polynomial Loss over Wasserstein Balls
This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We establish the asymptotic convergence of a hierarchy of semi-definite programming (SDP) relaxations, providing a framework for approximating the optimal values of these inherently infinite-dimensional optimization problems. A central foundational contribution is the development of a new lifted positivity certificate: we demonstrate that piecewise polynomials positive over Archimedean basic semi-algebraic sets admit a structured system of sum-of-squares (SOS) representations. Furthermore, we prove that the proposed hierarchy achieves finite convergence under suitable conditions when the defining polynomials are convex. The practical utility and versatility of this approach are demonstrated via numerical experiments in revenue estimation and portfolio optimization.
- 8 May 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 209 (2) , 61
Open AccessConvergent Lifted Lasserre Hierarchy of SDPs for Minimizing Expectation of Piecewise Polynomial Loss over Wasserstein Balls
This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We establish the asymptotic convergence of a hierarchy of semi-definite programming (SDP) relaxations, providing a framework for approximating the optimal values of these inherently infinite-dimensional optimization problems. A central foundational contribution is the development of a new lifted positivity certificate: we demonstrate that piecewise polynomials positive over Archimedean basic semi-algebraic sets admit a structured system of sum-of-squares (SOS) representations. Furthermore, we prove that the proposed hierarchy achieves finite convergence under suitable conditions when the defining polynomials are convex. The practical utility and versatility of this approach are demonstrated via numerical experiments in revenue estimation and portfolio optimization.
- Open Access
- 27 February 2026
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 34 (1) , 7
A Duality-Guided Proximal Splitting Method for Robust Constrained Best Approximation via Convex Semi-Definite Program Reformulations
In this paper, we study a broad class of constrained best approximation problems in the face of data uncertainty. Adopting the deterministic robust optimisation framework, we model uncertainty using spectrahedral sets, which unify many convex uncertainty models commonly employed in practice. In this setting, the robust best approximation problem requires the solution to satisfy all constraints for every parameter in the prescribed spectrahedral sets, giving rise to a computationally difficult infinite-dimensional problem that may also involve infinitely many constraints. To address this difficulty, we employ convex optimisation duality and semi-definite optimisation techniques, and a variable transformation to reformulate the Lagrangian dual of the robust best approximation problem into a finite-dimensional convex semi-definite program. This enables the best approximation to be found from the solution of the dual problem via a solution recovery formula. By further reformulation of the dual to a convex composite unconstrained optimisation problem using convex conjugation techniques, we present a readily implementable first-order primal-dual proximal splitting method to compute the solution to the robust best approximation problem. Finally, we present the results of numerical experiments to illustrate our proposed approach.
- 27 February 2026
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 34 (1) , 7
Open AccessA Duality-Guided Proximal Splitting Method for Robust Constrained Best Approximation via Convex Semi-Definite Program Reformulations
In this paper, we study a broad class of constrained best approximation problems in the face of data uncertainty. Adopting the deterministic robust optimisation framework, we model uncertainty using spectrahedral sets, which unify many convex uncertainty models commonly employed in practice. In this setting, the robust best approximation problem requires the solution to satisfy all constraints for every parameter in the prescribed spectrahedral sets, giving rise to a computationally difficult infinite-dimensional problem that may also involve infinitely many constraints. To address this difficulty, we employ convex optimisation duality and semi-definite optimisation techniques, and a variable transformation to reformulate the Lagrangian dual of the robust best approximation problem into a finite-dimensional convex semi-definite program. This enables the best approximation to be found from the solution of the dual problem via a solution recovery formula. By further reformulation of the dual to a convex composite unconstrained optimisation problem using convex conjugation techniques, we present a readily implementable first-order primal-dual proximal splitting method to compute the solution to the robust best approximation problem. Finally, we present the results of numerical experiments to illustrate our proposed approach.
- Open Access
Convergent Lifted Lasserre Hierarchy of SDPs for Minimizing Expectation of Piecewise Polynomial Loss over Wasserstein Balls
This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We establish the asymptotic convergence of a hierarchy of semi-definite programming (SDP) relaxations, providing a framework for approximating the optimal values of these inherently infinite-dimensional optimization problems. A central foundational contribution is the development of a new lifted positivity certificate: we demonstrate that piecewise polynomials positive over Archimedean basic semi-algebraic sets admit a structured system of sum-of-squares (SOS) representations. Furthermore, we prove that the proposed hierarchy achieves finite convergence under suitable conditions when the defining polynomials are convex. The practical utility and versatility of this approach are demonstrated via numerical experiments in revenue estimation and portfolio optimization.
Open AccessConvergent Lifted Lasserre Hierarchy of SDPs for Minimizing Expectation of Piecewise Polynomial Loss over Wasserstein Balls
This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We establish the asymptotic convergence of a hierarchy of semi-definite programming (SDP) relaxations, providing a framework for approximating the optimal values of these inherently infinite-dimensional optimization problems. A central foundational contribution is the development of a new lifted positivity certificate: we demonstrate that piecewise polynomials positive over Archimedean basic semi-algebraic sets admit a structured system of sum-of-squares (SOS) representations. Furthermore, we prove that the proposed hierarchy achieves finite convergence under suitable conditions when the defining polynomials are convex. The practical utility and versatility of this approach are demonstrated via numerical experiments in revenue estimation and portfolio optimization.
- Open Access
Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
We propose a novel methodology for solving a two-stage adjustable robust convex optimisation problem with a general (proximable) convex objective function and constraints defined by sum-of-squares (SOS) convex polynomials. These problems appear in many decision-making applications. However, they are challenging to solve and typically cannot be reformulated as numerically tractable convex optimisation models, such as conic linear programs, that can be solved directly using existing software. We show that the robust problem admits an equivalent representation as a convex composite unconstrained optimisation model that preserves the same objective values, under quadratic decision rules on the adjustable decision variables. Building on this reformulation, we develop a tailored first-order primal-dual proximal splitting method. By leveraging semidefinite programming (SDP) techniques as well as tools from convex analysis and real algebraic geometry, we establish its theoretical properties, including computable SDP-based formulas for projections onto closed convex sets, specified by SOS-convex polynomial inequalities. Numerical experiments on a two-stage lot-sizing model with both linear as well as SOS-convex polynomial storage costs under demand uncertainty demonstrate the effectiveness and applicability of the proposed approach. Our approach enables the incorporation of SDP techniques into a primal-dual proximal splitting framework, thereby broadening the class of problems to which these methods can be effectively applied.
Open AccessInterwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
We propose a novel methodology for solving a two-stage adjustable robust convex optimisation problem with a general (proximable) convex objective function and constraints defined by sum-of-squares (SOS) convex polynomials. These problems appear in many decision-making applications. However, they are challenging to solve and typically cannot be reformulated as numerically tractable convex optimisation models, such as conic linear programs, that can be solved directly using existing software. We show that the robust problem admits an equivalent representation as a convex composite unconstrained optimisation model that preserves the same objective values, under quadratic decision rules on the adjustable decision variables. Building on this reformulation, we develop a tailored first-order primal-dual proximal splitting method. By leveraging semidefinite programming (SDP) techniques as well as tools from convex analysis and real algebraic geometry, we establish its theoretical properties, including computable SDP-based formulas for projections onto closed convex sets, specified by SOS-convex polynomial inequalities. Numerical experiments on a two-stage lot-sizing model with both linear as well as SOS-convex polynomial storage costs under demand uncertainty demonstrate the effectiveness and applicability of the proposed approach. Our approach enables the incorporation of SDP techniques into a primal-dual proximal splitting framework, thereby broadening the class of problems to which these methods can be effectively applied.
- Open Access
- 17 July 2025
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 13
A distributionally robust machine learning model of simultaneous classification and feature selection under data uncertainty: Theory, methods, and application to the identification of Alzheimer's disease using handwriting
- 17 July 2025
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 13
Open AccessA distributionally robust machine learning model of simultaneous classification and feature selection under data uncertainty: Theory, methods, and application to the identification of Alzheimer's disease using handwriting
- 22 April 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (5) , 055005
Online optimisation for dynamic electrical impedance tomography
Online optimisation studies the convergence of optimisation methods as the data embedded in the problem changes. Based on this idea, we propose a primal dual online method for nonlinear time-discrete inverse problems. We analyse the method through regret theory and demonstrate its performance in real-time monitoring of moving bodies in a fluid with electrical impedance tomography. To do so, we also prove the second-order differentiability of the complete electrode model solution operator on L ∞ .
- 22 April 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (5) , 055005
Online optimisation for dynamic electrical impedance tomography
Online optimisation studies the convergence of optimisation methods as the data embedded in the problem changes. Based on this idea, we propose a primal dual online method for nonlinear time-discrete inverse problems. We analyse the method through regret theory and demonstrate its performance in real-time monitoring of moving bodies in a fluid with electrical impedance tomography. To do so, we also prove the second-order differentiability of the complete electrode model solution operator on L ∞ .
- 10 October 2024
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 66 (6) , 1109-1134
Prediction Techniques for Dynamic Imaging with Online Primal–Dual Methods
- 10 October 2024
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 66 (6) , 1109-1134
Prediction Techniques for Dynamic Imaging with Online Primal–Dual Methods