Jan Kronqvist

Orcid: 0000-0003-0299-5745

According to our database1, Jan Kronqvist authored at least 25 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Optimizing Ensemble Models using Column Generation.
J. Optim. Theory Appl., November, 2024

A constrained optimization approach to improve robustness of neural networks.
CoRR, 2024

A GPU-Accelerated Bi-linear ADMM Algorithm for Distributed Sparse Machine Learning.
CoRR, 2024

A cutting plane algorithm for globally solving low dimensional k-means clustering problems.
CoRR, 2024

2023
Sparse convex optimization toolkit: a mixed-integer framework.
Optim. Methods Softw., November, 2023

Globally solving the Gromov-Wasserstein problem for point clouds in low dimensional Euclidean spaces.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Alternating Mixed-Integer Programming and Neural Network Training for Approximating Stochastic Two-Stage Problems.
Proceedings of the Machine Learning, Optimization, and Data Science, 2023

Model-Based Feature Selection for Neural Networks: A Mixed-Integer Programming Approach.
Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023

2022
The supporting hyperplane optimization toolkit for convex MINLP.
J. Glob. Optim., 2022

Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT.
J. Glob. Optim., 2022

Alternative regularizations for Outer-Approximation algorithms for convex MINLP.
J. Glob. Optim., 2022

P-split formulations: A class of intermediate formulations between big-M and convex hull for disjunctive constraints.
CoRR, 2022

Maximizing information from chemical engineering data sets: Applications to machine learning.
CoRR, 2022

Simulation-based optimization of distillation processes using an extended cutting plane algorithm.
Comput. Chem. Eng., 2022

2021
ENTMOOT: A framework for optimization over ensemble tree models.
Comput. Chem. Eng., 2021

Partition-Based Formulations for Mixed-Integer Optimization of Trained ReLU Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020
Using regularization and second order information in outer approximation for convex MINLP.
Math. Program., 2020

Efficient Verification of ReLU-Based Neural Networks via Dependency Analysis.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems.
Comput. Chem. Eng., 2019

On Solving Nonconvex MINLP Problems with SHOT.
Proceedings of the Optimization of Complex Systems: Theory, 2019

2018
Reformulations for utilizing separability when solving convex MINLP problems.
J. Glob. Optim., 2018

Structural learning in artificial neural networks using sparse optimization.
Neurocomputing, 2018

2017
Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems.
J. Glob. Optim., 2017

2016
The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming.
J. Glob. Optim., 2016


  Loading...