Yves Lucet
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yves Lucet has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Warren Hare
University of British Columbia
8 shared publications Warren Hare
Department of Mathematics
6 shared publications- Heinz H. Bauschke
Mathematics, University of British Columbia, Kelowna, B.C. V1V 1V7, Canada
4 shared publications - Homayoun Najjaran
University of Victoria
3 shared publications - Patricia Lasserre
The University of British Columbia
3 shared publications Bryan Gardiner
University of British Columbia Okanagan
2 shared publications
Latest Publications
- Open Access
- 4 May 2026
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 49
Optimal network topology and alignment design for minimizing construction costs of wind farm access roads
- 4 May 2026
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 49
Open AccessOptimal network topology and alignment design for minimizing construction costs of wind farm access roads
- 31 March 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 94 (2) , 747-780
Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
- 31 March 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 94 (2) , 747-780
Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
- Open Access
ConvNet-Generated Adversarial Perturbations for Evaluating 3D Object Detection Robustness
This paper presents a novel adversarial Convolutional Neural Network (ConvNet) method for generating adversarial perturbations in 3D point clouds, enabling gradient-free robustness evaluation of object detection systems at inference time. Unlike existing iterative gradient methods, our approach embeds the ConvNet directly into the detection pipeline at the voxel feature level. The ConvNet is trained to maximize detection loss while maintaining perturbations within sensor error bounds through multi-component loss constraints (intensity, bias, and imbalance terms). Evaluation on a Sparsely Embedded Convolutional Detection (SECOND) detector with the KITTI dataset shows 8% overall mean Average Precision (mAP) degradation, while CenterPoint on NuScenes exhibits 24% weighted mAP reduction across 10 object classes. Analysis reveals an inverse relationship between object size and adversarial vulnerability: smaller objects (pedestrians: 13%, cyclists: 14%) show higher vulnerability compared to larger vehicles (cars: 0.2%) on KITTI, with similar patterns on NuScenes, where barriers (68%) and pedestrians (32%) are most affected. Despite perturbations remaining within typical sensor error margins (mean L2 norm of 0.09% for KITTI, 0.05% for NuScenes, corresponding to 0.9–2.6 cm at typical urban distances), substantial detection failures occur. The key novelty is training a ConvNet to learn effective adversarial perturbations during a one-time training phase and then using the trained network for gradient-free robustness evaluation during inference, requiring only a forward pass through the ConvNet (1.2–2.0 ms overhead) instead of iterative gradient computation, making continuous vulnerability monitoring practical for autonomous driving safety assessment.
Open AccessConvNet-Generated Adversarial Perturbations for Evaluating 3D Object Detection Robustness
This paper presents a novel adversarial Convolutional Neural Network (ConvNet) method for generating adversarial perturbations in 3D point clouds, enabling gradient-free robustness evaluation of object detection systems at inference time. Unlike existing iterative gradient methods, our approach embeds the ConvNet directly into the detection pipeline at the voxel feature level. The ConvNet is trained to maximize detection loss while maintaining perturbations within sensor error bounds through multi-component loss constraints (intensity, bias, and imbalance terms). Evaluation on a Sparsely Embedded Convolutional Detection (SECOND) detector with the KITTI dataset shows 8% overall mean Average Precision (mAP) degradation, while CenterPoint on NuScenes exhibits 24% weighted mAP reduction across 10 object classes. Analysis reveals an inverse relationship between object size and adversarial vulnerability: smaller objects (pedestrians: 13%, cyclists: 14%) show higher vulnerability compared to larger vehicles (cars: 0.2%) on KITTI, with similar patterns on NuScenes, where barriers (68%) and pedestrians (32%) are most affected. Despite perturbations remaining within typical sensor error margins (mean L2 norm of 0.09% for KITTI, 0.05% for NuScenes, corresponding to 0.9–2.6 cm at typical urban distances), substantial detection failures occur. The key novelty is training a ConvNet to learn effective adversarial perturbations during a one-time training phase and then using the trained network for gradient-free robustness evaluation during inference, requiring only a forward pass through the ConvNet (1.2–2.0 ms overhead) instead of iterative gradient computation, making continuous vulnerability monitoring practical for autonomous driving safety assessment.
- 17 September 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (8) , 1-28
A unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks
- 17 September 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (8) , 1-28
A unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks
- Open Access
A unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks
The vertical alignment optimization problem in road design seeks the optimal vertical alignment of a road at minimal cost, taking into account earthwork while meeting all safety and design requirements. In recent years, modelling techniques have been advanced to incorporate: side slopes, multiple material types, multiple hauling types, and road networks. However, the advancements were created disjointly with implementations that only made a single advancement to the basic model. Herein, we present a mixed-integer linear programming optimization model that unifies all previous advancements. The model further improves on previous work by maintaining convexity even in the multi-material setting. We compare our new model to previous models, validate it numerically, and demonstrate its capability in approximating material volumes. Our new model performs particularly well for determining the optimal vertical alignment for large road networks.
Open AccessA unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks
The vertical alignment optimization problem in road design seeks the optimal vertical alignment of a road at minimal cost, taking into account earthwork while meeting all safety and design requirements. In recent years, modelling techniques have been advanced to incorporate: side slopes, multiple material types, multiple hauling types, and road networks. However, the advancements were created disjointly with implementations that only made a single advancement to the basic model. Herein, we present a mixed-integer linear programming optimization model that unifies all previous advancements. The model further improves on previous work by maintaining convexity even in the multi-material setting. We compare our new model to previous models, validate it numerically, and demonstrate its capability in approximating material volumes. Our new model performs particularly well for determining the optimal vertical alignment for large road networks.
- 27 May 2025
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (1) , 3-34
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
- 27 May 2025
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (1) , 3-34
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
- Open Access
A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
We propose the first linear-time algorithm to compute the conjugate of (nonconvex) bivariate piecewise linear-quadratic (PLQ) functions (bivariate quadratic functions defined on a polyhedral subdivision). Our algorithm starts with computing the convex envelope of each quadratic piece obtaining rational functions (quadratic over linear) defined over a polyhedral subdivision. Then we compute the conjugate of each resulting piece to obtain piecewise quadratic functions defined over a parabolic subdivision. Finally we compute the maximum of all those functions to obtain the conjugate as a piecewise quadratic function defined on a parabolic subdivision. The resulting algorithm runs in linear time if the initial subdivision is a triangulation (or has a uniform upper bound on the number of vertexes for each piece). Our open-source implementation in MATLAB uses symbolic computation and rational numbers to avoid floating-point errors, and merges pieces as soon as possible to minimize computation time.
Open AccessA linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
We propose the first linear-time algorithm to compute the conjugate of (nonconvex) bivariate piecewise linear-quadratic (PLQ) functions (bivariate quadratic functions defined on a polyhedral subdivision). Our algorithm starts with computing the convex envelope of each quadratic piece obtaining rational functions (quadratic over linear) defined over a polyhedral subdivision. Then we compute the conjugate of each resulting piece to obtain piecewise quadratic functions defined over a parabolic subdivision. Finally we compute the maximum of all those functions to obtain the conjugate as a piecewise quadratic function defined on a parabolic subdivision. The resulting algorithm runs in linear time if the initial subdivision is a triangulation (or has a uniform upper bound on the number of vertexes for each piece). Our open-source implementation in MATLAB uses symbolic computation and rational numbers to avoid floating-point errors, and merges pieces as soon as possible to minimize computation time.
- Open Access
Closest univariate convex linear-quadratic function approximation with minimal number of Pieces
We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we assume that the number and positions of the breakpoints of the output function are fixed, and solve a convex optimization problem. Next, we assume the number of breakpoints is fixed, but not their position, and solve a nonconvex optimization problem to determine optimal breakpoints placement. Finally, we propose an algorithm composed of a greedy search preprocessing and a dichotomic search that solves a logarithmic number of optimization problems to obtain an approximation of any PLQ function with minimal number of pieces thereby obtaining in two steps the closest convex function with minimal number of pieces. We illustrate our algorithms with multiple examples, compare our approach with a previous globally optimal univariate spline approximation algorithm, and apply our method to simplify vertical alignment curves in road design optimization. CPLEX, Gurobi, and BARON are used with the YALMIP library in MATLAB to effectively select the most efficient solver.
Open AccessClosest univariate convex linear-quadratic function approximation with minimal number of Pieces
We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we assume that the number and positions of the breakpoints of the output function are fixed, and solve a convex optimization problem. Next, we assume the number of breakpoints is fixed, but not their position, and solve a nonconvex optimization problem to determine optimal breakpoints placement. Finally, we propose an algorithm composed of a greedy search preprocessing and a dichotomic search that solves a logarithmic number of optimization problems to obtain an approximation of any PLQ function with minimal number of pieces thereby obtaining in two steps the closest convex function with minimal number of pieces. We illustrate our algorithms with multiple examples, compare our approach with a previous globally optimal univariate spline approximation algorithm, and apply our method to simplify vertical alignment curves in road design optimization. CPLEX, Gurobi, and BARON are used with the YALMIP library in MATLAB to effectively select the most efficient solver.
- Open Access
- 1 January 2025
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 32 (2) , 467-486
Closest Univariate Convex Linear-Quadratic Function Approximation with Minimal Number of Pieces
We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we assume that the number and positions of the breakpoints of the output function are fixed, and solve a convex optimization problem. Next, we assume the number of breakpoints is fixed, but not their position, and solve a nonconvex optimization problem to determine optimal breakpoints placement. Finally, we propose an algorithm composed of a greedy search preprocessing and a dichotomic search that solves a logarithmic number of optimization problems to obtain an approximation of any PLQ function with minimal number of pieces thereby obtaining in two steps the closest convex function with minimal number of pieces. We illustrate our algorithms with multiple examples, compare our approach with a previous globally optimal univariate spline approximation algorithm, and apply our method to simplify vertical alignment curves in road design optimization. CPLEX, Gurobi, and BARON are used with the YALMIP library in MATLAB to effectively select the most efficient solver.
- 1 January 2025
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 32 (2) , 467-486
Open AccessClosest Univariate Convex Linear-Quadratic Function Approximation with Minimal Number of Pieces
We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we assume that the number and positions of the breakpoints of the output function are fixed, and solve a convex optimization problem. Next, we assume the number of breakpoints is fixed, but not their position, and solve a nonconvex optimization problem to determine optimal breakpoints placement. Finally, we propose an algorithm composed of a greedy search preprocessing and a dichotomic search that solves a logarithmic number of optimization problems to obtain an approximation of any PLQ function with minimal number of pieces thereby obtaining in two steps the closest convex function with minimal number of pieces. We illustrate our algorithms with multiple examples, compare our approach with a previous globally optimal univariate spline approximation algorithm, and apply our method to simplify vertical alignment curves in road design optimization. CPLEX, Gurobi, and BARON are used with the YALMIP library in MATLAB to effectively select the most efficient solver.
- 18 November 2024
- Published by Emerald Publishing in Business Process Management Journal
- Vol. 31 (4) , 1414-1452
A review of AI and machine learning contribution in business process management (process enhancement and process improvement approaches)
Purpose: The significance of business processes has fostered a close collaboration between academia and industry. Moreover, the business landscape has witnessed continuous transformation, closely intertwined with technological advancements. Our main goal is to offer researchers and process analysts insights into the latest developments concerning artificial intelligence (AI) and machine learning (ML) to optimize their processes in an organization and identify research gaps and future directions in the field. Design/methodology/approach: In this study, we perform a systematic review of academic literature to investigate the integration of AI/ML in business process management (BPM). We categorize the literature according to the BPM life-cycle and employ bibliometric and objective-oriented methodology to analyze related papers. Findings: In business process management and process map, AI/ML has made significant improvements using operational data on process metrics. These developments involve two distinct stages: (1) process enhancement, which emphasizes analyzing process information and adding descriptions to process models and (2) process improvement, which focuses on redesigning processes based on insights derived from analysis. Research limitations/implications: While this review paper serves to provide an overview of different approaches for addressing process-related challenges, it does not delve deeply into the intricacies of fine-grained technical details of each method. This work focuses on recent papers conducted between 2010 and 2024. Originality/value: This work addresses a significant gap by employing a pioneering approach to introduce challenges in BPM alongside AI/ML techniques and integrated tools. Hence, it offers comprehensive guidelines that elucidate the alignment between ML methods and solutions to current challenges across the BPM life-cycle, including process enhancement and process improvement. Additionally, by detailing various aspects of the life-cycle phases and highlighting ML technique characteristics, this research demonstrates potential approaches for future exploration, thereby enhancing applicability for both process analysts and researchers in this context.
- 18 November 2024
- Published by Emerald Publishing in Business Process Management Journal
- Vol. 31 (4) , 1414-1452
A review of AI and machine learning contribution in business process management (process enhancement and process improvement approaches)
Purpose: The significance of business processes has fostered a close collaboration between academia and industry. Moreover, the business landscape has witnessed continuous transformation, closely intertwined with technological advancements. Our main goal is to offer researchers and process analysts insights into the latest developments concerning artificial intelligence (AI) and machine learning (ML) to optimize their processes in an organization and identify research gaps and future directions in the field. Design/methodology/approach: In this study, we perform a systematic review of academic literature to investigate the integration of AI/ML in business process management (BPM). We categorize the literature according to the BPM life-cycle and employ bibliometric and objective-oriented methodology to analyze related papers. Findings: In business process management and process map, AI/ML has made significant improvements using operational data on process metrics. These developments involve two distinct stages: (1) process enhancement, which emphasizes analyzing process information and adding descriptions to process models and (2) process improvement, which focuses on redesigning processes based on insights derived from analysis. Research limitations/implications: While this review paper serves to provide an overview of different approaches for addressing process-related challenges, it does not delve deeply into the intricacies of fine-grained technical details of each method. This work focuses on recent papers conducted between 2010 and 2024. Originality/value: This work addresses a significant gap by employing a pioneering approach to introduce challenges in BPM alongside AI/ML techniques and integrated tools. Hence, it offers comprehensive guidelines that elucidate the alignment between ML methods and solutions to current challenges across the BPM life-cycle, including process enhancement and process improvement. Additionally, by detailing various aspects of the life-cycle phases and highlighting ML technique characteristics, this research demonstrates potential approaches for future exploration, thereby enhancing applicability for both process analysts and researchers in this context.