Jon Lee

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 60

Top Venues

Publications

Yushan Qu, Jon Lee
On Disjunction Convex Hulls by Lifting. ISCO (2024)
Marcia Fampa, Jon Lee
An outer-approximation algorithm for maximum-entropy sampling. Discret. Appl. Math. 347 (2024)
Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao
D-Optimal Data Fusion: Exact and Approximation Algorithms. INFORMS J. Comput. 36 (1) (2024)
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. ISCO (2024)
Gabriel Ponte, Marcia Fampa, Jon Lee
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. SEA (2024)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Math. Program. 206 (1) (2024)
Luze Xu, Jon Lee
Gaining or losing perspective for convex multivariate functions on a simplex. J. Glob. Optim. 89 (2) (2024)
Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu
On computing sparse generalized inverses. Oper. Res. Lett. 52 (2024)
Zhongzhu Chen, Marcia Fampa, Jon Lee
Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds. Oper. Res. 72 (2) (2024)
Zhongzhu Chen, Marcia Fampa, Jon Lee
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem. INFORMS J. Comput. 35 (2) (2023)
Hessa Al-Thani, Jon Lee
Tridiagonal maximum-entropy sampling and tridiagonal masks. Discret. Appl. Math. 337 (2023)
Zhongzhu Chen, Marcia Fampa, Jon Lee
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem. ACDA (2023)
Jon Lee, Daphne E. Skipper, Emily Speakman, Luze Xu
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions. J. Optim. Theory Appl. 196 (1) (2023)
Jon Lee, Daphne E. Skipper, Emily Speakman
Gaining or losing perspective. J. Glob. Optim. 82 (4) (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. CoRR (2022)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. IPCO (2022)
Jon Lee, Ali Ridha Mahjoub, Giovanni Rinaldi
Preface: Combinatorial Optimization ISCO 2018. Discret. Appl. Math. 308 (2022)
Marcia Fampa, Jon Lee
An Outer-Approximation Algorithm for Maximum-Entropy Sampling. ISCO (2022)
Luze Xu, Marcia Fampa, Jon Lee, Gabriel Ponte
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search. SIAM J. Optim. 31 (3) (2021)
Yan Deng, Huiwen Jia, Shabbir Ahmed, Jon Lee, Siqian Shen
Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs. INFORMS J. Comput. 33 (2) (2021)
Hessa Al-Thani, Jon Lee
Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks. LAGOS (2021)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR (2021)
Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee
Mixing convex-optimization bounds for maximum-entropy sampling. Math. Program. 188 (2) (2021)
Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu
Experimental analysis of local searches for sparse reflexive generalized inverses. J. Glob. Optim. 81 (4) (2021)
Marcia Fampa, Jon Lee, Gabriel Ponte
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. Open J. Math. Optim. 2 (2021)
Marcia Fampa, Jon Lee
Convexification of bilinear forms through non-symmetric lifting. J. Glob. Optim. 80 (2) (2021)
Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu
Improving Proximity Bounds Using Sparsity. ISCO (2020)
Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 36 (1) (2020)
Jon Lee, Leo Liberti
On an SDP relaxation for kissing number. Optim. Lett. 14 (2) (2020)
Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos
Handling Separable Non-convexities Using Disjunctive Cuts. ISCO (2020)
Hessa Al-Thani, Jon Lee
An R Package for Generating Covariance Matrices for Maximum-Entropy Sampling from Precipitation Chemistry Data. Oper. Res. Forum 1 (3) (2020)
Hessa Al-Thani, Jon Lee
An R Package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data. CoRR (2020)
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optim. Lett. 14 (2) (2020)
Jon Lee, Daphne E. Skipper, Emily Speakman, Luze Xu
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions. CoRR (2020)
Marcia Fampa, Jon Lee, Gabriel Ponte
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. CoRR (2020)
Jon Lee, Daphne E. Skipper
Volume computation for sparse Boolean quadric relaxations. Discret. Appl. Math. 275 (2020)
Jon Lee, Joy Lind
Generalized maximum-entropy sampling. INFOR Inf. Syst. Oper. Res. 58 (2) (2020)
Luze Xu, Jon Lee
On Proximity for k-Regular Mixed-Integer Linear Optimization. WCGO (2019)
Victor K. Fuentes, Marcia Fampa, Jon Lee
Diving for Sparse Partially-Reflexive Generalized Inverses. WCGO (2019)
Luze Xu, Jon Lee, Daphne E. Skipper
More Virtuous Smoothing. SIAM J. Optim. 29 (2) (2019)
Jon Lee, Daphne E. Skipper, Emily Speakman
Gaining or Losing Perspective. WCGO (2019)
Emily Speakman, Jon Lee
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation. J. Glob. Optim. 72 (2) (2018)
Jon Lee, Daphne E. Skipper, Emily Speakman
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations. Math. Program. 170 (1) (2018)
Marcia Fampa, Jon Lee
On sparse reflexive generalized inverse. Oper. Res. Lett. 46 (6) (2018)
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Approximating max-cut under graph-MSO constraints. Oper. Res. Lett. 46 (6) (2018)
Xiangkun Shen, Jon Lee, Viswanath Nagarajan
Approximating graph-constrained max-cut. Math. Program. 172 (1-2) (2018)
Marcia Fampa, Jon Lee
On Sparse Reflexive Generalized Inverses. CoRR (2018)
Jon Lee, Daphne E. Skipper
Computing with an algebraic-perturbation variant of Barvinok's algorithm. Discret. Appl. Math. 240 (2018)
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Approximating Max-Cut under Graph-MSO Constraints. CoRR (2018)
Marcia Fampa, Jon Lee, Wendel Melo
On global optimization with indefinite quadratics. EURO J. Comput. Optim. 5 (3) (2017)
Emily Speakman, Jon Lee
Quantifying Double McCormick. Math. Oper. Res. 42 (4) (2017)
Jon Lee, Daphne E. Skipper
Virtuous smoothing for global optimization. J. Glob. Optim. 69 (3) (2017)
Emily Speakman, Han Yu, Jon Lee
Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations. CPAIOR (2017)
Jon Lee, Angelika Wiegele
Another pedagogy for mixed-integer Gomory. EURO J. Comput. Optim. 5 (4) (2017)
Qi He, Jon Lee
Another pedagogy for pure-integer Gomory. RAIRO Oper. Res. 51 (1) (2017)
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Max-Cut Under Graph Constraints. IPCO (2016)
Marcia Fampa, Jon Lee, Nelson Maculan
-space. Int. Trans. Oper. Res. 23 (5) (2016)
Victor K. Fuentes, Jon Lee
Low-Rank/Sparse-Inverse Decomposition via Woodbury. OR (2016)
Marcia Fampa, Jon Lee, Wendel Melo
-space. Comput. Optim. Appl. 65 (1) (2016)
Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 32 (5) (2016)
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
Max-Cut under Graph Constraints. CoRR (2015)
Jesús A. De Loera, Raymond Hemmecke, Jon Lee
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond. SIAM J. Optim. 25 (4) (2015)
Jon Lee, Daphne E. Skipper
An algebraic-perturbation variant of Barvinok's algorithm. Electron. Notes Discret. Math. 50 (2015)
Jon Lee, Jens Vygen
Preface. Math. Program. 154 (1-2) (2015)
Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
Extended Formulations for Independence Polytopes of Regular Matroids. CoRR (2015)
Jesús A. De Loera, Jon Lee, Susan Margulies, J. Miller
Weak orientability of matroids and polynomial equations. Eur. J. Comb. 50 (2015)
Andrew Orso, Jon Lee, Siqian Shen
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers. SEA (2015)
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. SEA (2015)
Jon Lee, Bai Zou
Optimal rank-sparsity decomposition. J. Glob. Optim. 60 (2) (2014)
Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
On the number of realizations of certain Henneberg graphs arising in protein conformation. Discret. Appl. Math. 165 (2014)
Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Wächter
On branching rules for convex mixed-integer nonlinear optimization. ACM J. Exp. Algorithmics 18 (2013)
Jon Lee, Maxim Sviridenko, Jan Vondrák
Matroid Matching: The Power of Local Search. SIAM J. Comput. 42 (1) (2013)
Binyamin Krauss, Jon Lee, Daniel Newman
Optimizing the Assignment of Students to Classes in an Elementary School. INFORMS Trans. Educ. 14 (1) (2013)
Jesús A. De Loera, Jon Lee, Susan Margulies, J. Miller
Systems of Polynomials for Detecting Orientable Matroids. Electron. Notes Discret. Math. 43 (2013)
Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko
Discretization orders for distance geometry problems. Optim. Lett. 6 (4) (2012)
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. 136 (2) (2012)
Jon Lee, Leo Liberti
A matroid view of key theorems for edge-swapping algorithms. Math. Methods Oper. Res. 76 (2) (2012)
Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. J. Symb. Comput. 46 (11) (2011)
Anureet Saxena, Pierre Bonami, Jon Lee
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130 (2) (2011)
Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. COCOA (2011)
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR (2011)
Jon Lee, Maxim Sviridenko, Jan Vondrák
Matroid matching: the power of local search. STOC (2010)
Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
On the number of solutions of the discretizable molecular distance geometry problem CoRR (2010)
Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel
Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124 (1-2) (2010)
Jon Lee, Shmuel Onn, Robert Weismantel
Intractability of approximate multi-dimensional nonlinear optimization on independence systems. CoRR (2010)
Anureet Saxena, Pierre Bonami, Jon Lee
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124 (1-2) (2010)
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions CoRR (2010)
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti
On the Convergence of Feasibility based Bounds Tightening. CTW (2010)
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti
Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) (2010)
Jon Lee, Maxim Sviridenko, Jan Vondrák
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Math. Oper. Res. 35 (4) (2010)
Sonia Cafieri, Jon Lee, Leo Liberti
On convex relaxations of quadrilinear terms. J. Glob. Optim. 47 (4) (2010)
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discret. Math. 23 (4) (2010)
John A. Gunnels, Jon Lee, Susan Margulies
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization. Math. Program. Comput. 2 (2) (2010)
Jon Lee, Shmuel Onn, Robert Weismantel
Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discret. Math. 23 (4) (2009)
Jon Lee
On the Boundary of Tractability for Nonlinear Discrete Optimization. CTW (2009)
Jesús A. De Loera, David C. Haws, Jon Lee, Allison O'Hair
Computation in multicriteria matroid optimization. ACM J. Exp. Algorithmics 14 (2009)
Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter
Branching and bounds tighteningtechniques for non-convex MINLP. Optim. Methods Softw. 24 (4-5) (2009)
Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Comb. Probab. Comput. 18 (4) (2009)
Claudia D'Ambrosio, Jon Lee, Andreas Wächter
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. ESA (2009)
Jon Lee, Shmuel Onn, Robert Weismantel
Nonlinear Optimization over a Weighted Independence System. AAIM (2009)

Jon Lee.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jon Lee