Laura Palagi

According to our database1, Laura Palagi authored at least 30 papers between 1998 and 2020.

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



In proceedings 
PhD thesis 


Online presence:



Block layer decomposition schemes for training deep neural networks.
J. Glob. Optim., 2020

Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming.
Eur. J. Oper. Res., 2020

Global optimization issues in deep network regression: an overview.
J. Glob. Optim., 2019

Case - Production and Distribution Optimization of Beach Equipment for the Marinero Company.
INFORMS Trans. Educ., 2019

Case Article - Production and Distribution Optimization of Beach Equipment for the Marinero Company.
INFORMS Trans. Educ., 2019

Swlda Offers a Valuable Trade-off between interpretability and accuracy for rehabilitative BCIs.
Proceedings of the 8th Graz Brain-Computer Interface Conference 2019, 2019

Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training.
Comput. Optim. Appl., 2018

One-Way Free Floating Car-Sharing: Applying Vehicle-Generated Data to Assess the Market Demand Potential of Urban Zones.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations.
Oper. Res. Lett., 2015

Optim. Methods Softw., 2015

Using SVM to combine global heuristics for the Standard Quadratic Problem.
Eur. J. Oper. Res., 2015

A QoE-aware dynamic bandwidth allocation algorithm based on game theory.
Proceedings of the 23rd Mediterranean Conference on Control and Automation, 2015

Profiled QoE based network controller.
Proceedings of the 23rd Mediterranean Conference on Control and Automation, 2015

An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations.
SIAM J. Optim., 2013

SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances.
Math. Program., 2012

On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds.
Optim. Lett., 2011

An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.
Math. Program., 2011

A truncated Newton method in an augmented Lagrangian framework for nonlinear programming.
Comput. Optim. Appl., 2010

Large Scale Trust Region Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Convergent Hybrid Decomposition Algorithm Model for SVM Training.
IEEE Trans. Neural Networks, 2009

Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems.
J. Glob. Optim., 2009

A convergent decomposition algorithm for support vector machines.
Comput. Optim. Appl., 2007

On the convergence of a modified version of SVM<sup><i>light</i></sup> algorithm.
Optim. Methods Softw., 2005

Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming.
Math. Oper. Res., 2005

Quartic Formulation of Standard Quadratic Optimization Problems.
J. Glob. Optim., 2005

An Exact Augmented Lagrangian Function for Nonlinear Programming with Two-Sided Constraints.
Comput. Optim. Appl., 2003

A Truncated Newton Algorithm for Large Scale Box Constrained Optimization.
SIAM J. Optim., 2002

A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem.
Transp. Sci., 1999

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems.
Comput. Optim. Appl., 1999

On Some Properties of Quadratic Programs with a Convex Quadratic Constraint.
SIAM J. Optim., 1998