| Publication | Date of Publication | Type |
|---|
Tuning parameters of deep neural network training algorithms pays off: a computational study
Top | 2024-11-12 | Paper |
A compact formulation for the base station deployment problem in wireless networks
Networks | 2023-12-18 | Paper |
Margin optimal classification trees
Computers & Operations Research | 2023-11-15 | Paper |
CMA Light: a novel Minibatch Algorithm for large-scale non convex finite sum optimization
| 2023-07-28 | Paper |
A computational study of off-the-shelf MINLP solvers on a benchmark set of congested capacitated facility location problems
| 2023-03-07 | Paper |
On the convergence of a block-coordinate incremental gradient method
Soft Computing | 2022-11-22 | Paper |
Block layer decomposition schemes for training deep neural networks
Journal of Global Optimization | 2020-04-23 | Paper |
Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
European Journal of Operational Research | 2020-01-23 | Paper |
Global optimization issues in deep network regression: an overview
Journal of Global Optimization | 2019-05-09 | Paper |
Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
Computational Optimization and Applications | 2018-10-02 | Paper |
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Operations Research Letters | 2018-09-28 | Paper |
Using SVM to combine global heuristics for the standard quadratic problem
European Journal of Operational Research | 2016-07-06 | Paper |
Computational approaches to MAX-cut
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
A Class of Parallel Decomposition Algorithms for SVMs Training
| 2015-09-17 | Paper |
An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
SIAM Journal on Optimization | 2013-12-13 | Paper |
Unconstrained formulation of standard quadratic optimization problems
Top | 2013-02-20 | Paper |
SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
Optimization Letters | 2011-05-20 | Paper |
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
Computational Optimization and Applications | 2010-03-19 | Paper |
Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
Journal of Global Optimization | 2009-09-02 | Paper |
Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
Journal of Optimization Theory and Applications | 2009-07-10 | Paper |
Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
Mathematics of Operations Research | 2008-05-27 | Paper |
A convergent decomposition algorithm for support vector machines
Computational Optimization and Applications | 2008-03-11 | Paper |
Quartic formulation of standard quadratic optimization problems
Journal of Global Optimization | 2005-12-13 | Paper |
On the convergence of a modified version of SVMlightalgorithm
Optimization Methods & Software | 2005-09-21 | Paper |
scientific article; zbMATH DE number 2068034 (Why is no real title available?)
| 2004-05-27 | Paper |
An exact augmented Lagrangian function for nonlinear programming with two-sided con\-straints
Computational Optimization and Applications | 2003-06-09 | Paper |
A mathematical programming approach for the solution of the railway yield management problem
Transportation Science | 2003-01-20 | Paper |
A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
SIAM Journal on Optimization | 2003-01-05 | Paper |
A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables
Optimization Methods & Software | 2002-07-16 | Paper |
scientific article; zbMATH DE number 1568984 (Why is no real title available?)
| 2001-05-01 | Paper |
scientific article; zbMATH DE number 1424209 (Why is no real title available?)
| 2000-09-24 | Paper |
A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
Computational Optimization and Applications | 1999-01-01 | Paper |
scientific article; zbMATH DE number 1182579 (Why is no real title available?)
| 1998-08-02 | Paper |
On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
SIAM Journal on Optimization | 1998-05-12 | Paper |
An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables
Optimization | 1995-05-15 | Paper |
Computational issues in Optimization for Deep networks
| N/A | Paper |
