The following pages link to Laura Palagi (Q537650):
Displayed 37 items.
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
- Item:Q537650 (redirect page) (← links)
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
- A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems (Q1294812) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training (Q1790674) (← links)
- An exact augmented Lagrangian function for nonlinear programming with two-sided con\-straints (Q1810969) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- Block layer decomposition schemes for training deep neural networks (Q2173515) (← links)
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
- A convergent decomposition algorithm for support vector machines (Q2475612) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
- Global optimization issues in deep network regression: an overview (Q2633536) (← links)
- A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem (Q2783846) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations (Q2866210) (← links)
- An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables (Q3835628) (← links)
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint (Q4389183) (← links)
- (Q4400649) (← links)
- (Q4464633) (← links)
- A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables (Q4521379) (← links)
- (Q4762514) (← links)
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization (Q4785864) (← links)
- (Q4945412) (← links)
- On the convergence of a modified version of SVM<i><sup>light</sup></i>algorithm (Q5317752) (← links)
- Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming (Q5387954) (← links)
- Margin optimal classification trees (Q6065640) (← links)
- A compact formulation for the base station deployment problem in wireless networks (Q6179723) (← links)
- A Class of Parallel Decomposition Algorithms for SVMs Training (Q6265548) (← links)
- A computational study of off-the-shelf MINLP solvers on a benchmark set of congested capacitated facility location problems (Q6428745) (← links)
- CMA Light: a novel Minibatch Algorithm for large-scale non convex finite sum optimization (Q6445511) (← links)