Skip to main content
English
Italiano
Search form
Search
legibility:
standard
|
enhanced
Department of Computer, Control and Management Engineering
Toggle navigation
Department
Contacts
Foreword
How to reach us
Management
People
Structures
Laboratories
Classrooms
Library
Teaching
Study programs
PhD programs
Teaching laboratories
Multimedia
Research
Overview
Research areas
Research Laboratories
Seminars and events
Research reports
DIAG Reports
Technical reports
interdepartmental centers
Spin-offs
Public engagement
News
News
Events calendar
DIAG on 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
« first
‹ previous
…
354
355
356
357
358
359
360
361
362
…
next ›
last »
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma