Salta al contenuto principale
English
Italiano
Form di ricerca
Cerca
legibility:
standard
|
enhanced
Dipartimento di Ingegneria informatica, automatica e gestionale
Toggle navigation
Dipartimento
Home
Chi siamo
Dove siamo
Governo
Persone
Uffici
Trasparenza
Bandi
Commissioni
Strutture
Laboratori
Aule
Biblioteca
Didattica
Ricerca
Panoramica
Aree di ricerca
Gruppi di ricerca
Eventi e seminari
Progetti di ricerca
Keyword search
Visiting professors
Research Reports
DIAG Reports
Technical Reports
Centri interdipartimentali
Spin-off
Frequentatori esterni
Terza missione
Notizie
DIAG sui media
Seminars & events
Home
»
Tipologia Iris
»
01a Articolo Rivista
01a Articolo in rivista
Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds
A convergent decomposition algorithm for support vector machines
On the convergence of a modified version of SVMlight algorithm
Convergence to 2-nd order stationary points of a primal-dual algorithm model for nonlinear programming
Quartic formulation of standard quadratic optimization
An exact augmented Lagrangian function for nonlinear programming with two-sided constraints
A truncated Newton algorithm for large scale box constrained optimization
A superlinearly convergent primal-dual algorithm model for constrained optimization problems with bounded variables
A mathematical programming approach for the solution of the railway yield management problem
« prima
‹ precedente
…
354
355
356
357
358
359
360
361
362
…
seguente ›
ultima »
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma