default search action
Yves Lucet
Person information
- affiliation: University of British Columbia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i2]Mostafa Abbasi, Rahnuma Islam Nishat, Corey Bond, John Brandon Graham-Knight, Patricia Lasserre, Yves Lucet, Homayoun Najjaran:
A Review of AI and Machine Learning Contribution in Predictive Business Process Management (Process Enhancement and Process Improvement Approaches). CoRR abs/2407.11043 (2024) - 2023
- [j29]Nusrat Suzana Momo, Warren L. Hare, Yves Lucet:
Modeling side slopes in vertical alignment resource road construction using convex optimization. Comput. Aided Civ. Infrastructure Eng. 38(2): 211-224 (2023) - [j28]John Brandon Graham-Knight
, Corey Bond
Predicting and explaining performance and diversity of neural network architecture for semantic segmentation. Expert Syst. Appl. 214: 119101 (2023) - 2022
- [j27]Dominique Monnet
A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design. Comput. Optim. Appl. 81(3): 741-767 (2022) - [j26]Ayazhan Akhmet, Warren L. Hare
Bi-objective optimization for road vertical alignment design. Comput. Oper. Res. 143: 105764 (2022) - 2021
- [j25]Shambhavi Singh
Linear-Time Convexity Test for Low-Order Piecewise Polynomials. SIAM J. Optim. 31(1): 972-990 (2021) - 2020
- [j24]Dominique Monnet
Fast feasibility check of the multi-material vertical alignment problem in road design. Comput. Optim. Appl. 75(2): 515-536 (2020)
2010 – 2019
- 2019
- [c3]Deepak Kumar, Yves Lucet
Towards the Biconjugate of Bivariate Piecewise Quadratic Functions. WCGO 2019: 257-266 - 2018
- [j23]Tasnuva Haque, Yves Lucet
A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions. Comput. Optim. Appl. 70(2): 593-613 (2018) - 2017
- [j22]Anuj Bajaj, Warren L. Hare, Yves Lucet:
Visualization of the \(\varepsilon \) -subdifferential of piecewise linear-quadratic functions. Comput. Optim. Appl. 67(2): 421-442 (2017) - 2016
- [j21]Yasha Pushak, Warren L. Hare, Yves Lucet:
Multiple-path selection for new highway alignments using discrete algorithms. Eur. J. Oper. Res. 248(2): 415-427 (2016) - 2015
- [j20]Sukanto Mondal, Yves Lucet, Warren L. Hare:
Optimizing horizontal alignment of roads in a specified corridor. Comput. Oper. Res. 64: 130-138 (2015) - [j19]Warren L. Hare, Yves Lucet, Faisal Rahman:
A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction. Eur. J. Oper. Res. 241(3): 631-641 (2015) - [i1]Yasha Pushak, Warren L. Hare, Yves Lucet:
Multiple-Path Selection for new Highway Alignments using Discrete Algorithms. CoRR abs/1508.03064 (2015) - 2014
- [j18]Bryan Gardiner
Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions. Comput. Optim. Appl. 58(1): 249-272 (2014) - [j17]Warren L. Hare, Shahadat Hossain, Yves Lucet, Faisal Rahman:
Models and strategies for efficiently determining an optimal vertical alignment of roads. Comput. Oper. Res. 44: 161-173 (2014) - [j16]Warren L. Hare, Yves Lucet:
Derivative-Free Optimization Via Proximal Point Methods. J. Optim. Theory Appl. 160(1): 204-220 (2014) - [c2]Anna Offenwanger, Yves Lucet:
ConEE: An Exhaustive Testing Tool to Support Learning Concurrent Programming Synchronization Challenges. WCCCE 2014: 11:1-11:6 - 2013
- [j15]Bryan Gardiner, Yves Lucet:
Computing the conjugate of convex piecewise linear-quadratic bivariate functions. Math. Program. 139(1-2): 161-184 (2013) - 2011
- [j14]Warren L. Hare, Valentin R. Koch, Yves Lucet:
Models and algorithms to improve earthwork operations in road design using mixed integer linear programming. Eur. J. Oper. Res. 215(2): 470-480 (2011) - [j13]Jennifer A. Johnstone, Valentin R. Koch, Yves Lucet:
Convexity of the Proximal Average. J. Optim. Theory Appl. 148(1): 107-124 (2011) - [p1]Bryan Gardiner, Yves Lucet:
Graph-Matrix Calculus for Computational Convex Analysis. Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011: 243-259 - 2010
- [j12]Yves Lucet:
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications. SIAM Rev. 52(3): 505-542 (2010)
2000 – 2009
- 2009
- [j11]Yves Lucet, Heinz H. Bauschke
The piecewise linear-quadratic model for computational convex analysis. Comput. Optim. Appl. 43(1): 95-118 (2009) - [j10]Yves Lucet:
New sequential exact Euclidean distance transform algorithms based on convex analysis. Image Vis. Comput. 27(1-2): 37-44 (2009) - [j9]Yves Lucet:
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications. SIAM J. Optim. 20(1): 216-250 (2009) - 2008
- [j8]Heinz H. Bauschke
The Proximal Average: Basic Theory. SIAM J. Optim. 19(2): 766-785 (2008) - [j7]Heinz H. Bauschke
How to Transform One Convex Function Continuously into Another. SIAM Rev. 50(1): 115-132 (2008) - 2007
- [j6]Heinz H. Bauschke
Primal-Dual Symmetric Intrinsic Methods for Finding Antiderivatives of Cyclically Monotone Operators. SIAM J. Control. Optim. 46(6): 2031-2051 (2007) - 2006
- [j5]Yves Lucet:
Fast Moreau envelope computation I: numerical algorithms. Numer. Algorithms 43(3): 235-249 (2006) - 2005
- [c1]Yves Lucet:
A Linear Euclidean Distance Transform Algorithm Based on the Linear-Time Legendre Transform. CRV 2005: 262-267 - 2002
- [j4]Yves Lucet, Jane J. Ye
Erratum: Sensitivity Analysis of the Value Function for Optimization Problems With Variational Inequality Constraints. SIAM J. Control. Optim. 41(4): 1315-1319 (2002) - 2001
- [j3]Yves Lucet, Jane J. Ye
Sensitivity Analysis of the Value Function for Optimization Problems with Variational Inequality Constraints. SIAM J. Control. Optim. 40(3): 699-723 (2001)
1990 – 1999
- 1997
- [j2]Yves Lucet:
Faster than the Fast Legendre Transform, the Linear-time Legendre Transform. Numer. Algorithms 16(2): 171-185 (1997) - 1996
- [j1]Yves Lucet:
A fast computational algorithm for the Legendre-Fenchel transform. Comput. Optim. Appl. 6(1): 27-57 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: