Andreas Lundell

Orcid: 0000-0002-1548-1893

Affiliations:
  • Abo Akademi University, Turku, Finland


According to our database1, Andreas Lundell authored at least 12 papers between 2009 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

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

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

Solving global optimization problems using reformulations and signomial transformations.
Comput. Chem. Eng., 2018

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

2013
A reformulation framework for global optimization.
J. Glob. Optim., 2013

Improved Discrete Reformulations for the Quadratic Assignment Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2009
Convex underestimation strategies for signomial functions.
Optim. Methods Softw., 2009

Some transformation techniques with applications in global optimization.
J. Glob. Optim., 2009


  Loading...