Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Gianni Di Pillo"'
Publikováno v:
4OR.
This paper deals with the problem of cruise itinerary planning which plays a central role in worldwide cruise ship tourism. In particular, the Day-by-day Cruise Itinerary Optimization (DCIO) problem is considered. Assuming that a cruise has been plan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ffb1ae2fb7c3dbf1eb371378e1b282a
https://doi.org/10.1007/s10288-023-00536-6
https://doi.org/10.1007/s10288-023-00536-6
In this paper, we consider nonlinear optimization problems with nonlinear equality constraints and bound constraints on the variables. For the solution of such problems, many augmented Lagrangian methods have been defined in the literature. Here, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d159832cb9ca5ce8bde8575b671c5891
http://arxiv.org/abs/2104.15018
http://arxiv.org/abs/2104.15018
A cruise company faces three decision problems: at a strategic level, to decide in which maritime area and in which season window to locate each ship of its fleet; at a tactical level, given a ship in a maritime area and in a season window, to decide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5031e81fd837e3d15c964f04ae4fadba
http://hdl.handle.net/11573/1408726
http://hdl.handle.net/11573/1408726
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 35:1224-1228
Yield optimization is a challenging topic in electronic circuit design. Methods for yield optimization based on Monte Carlo (MC) analysis of a circuit whose behavior is reproduced by simulations usually require too many time expensive simulations to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afa6f0e2109d96aef47f713eb3908a08
https://doi.org/10.1109/tcad.2015.2501307
https://doi.org/10.1109/tcad.2015.2501307
Autor:
Gianni Di Pillo, Massimo Roma
Publikováno v:
Computational Optimization and Applications. 65:309-311
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::861e58f8b66989a3be59796830c72049
https://doi.org/10.1007/s10589-016-9877-2
https://doi.org/10.1007/s10589-016-9877-2
Publikováno v:
Journal of Optimization Theory and Applications. 164:862-882
Constrained global optimization problems can be tackled by using exact penalty approaches. In a preceding paper, we proposed an exact penalty algorithm for constrained problems which combines an unconstrained global minimization technique for minimiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05723095c6a80a98a9ca2fed2b013357
https://doi.org/10.1007/s10957-013-0487-1
https://doi.org/10.1007/s10957-013-0487-1
Publikováno v:
Mathematics in Industry ISBN: 9783319234120
In this work we propose an approach that combines a Support Vector learning Machine with a Derivative-Free black box optimization algorithm in order to maximize the yield in the production of electronic circuits. This approach is tested on a circuit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d74ddaf2f481eb80b531c6cd87da7e0d
https://doi.org/10.1007/978-3-319-23413-7_60
https://doi.org/10.1007/978-3-319-23413-7_60
Publikováno v:
Computational Optimization and Applications. 53:395-423
We are concerned with the solution of the bound constrained minimization problem {minf(x), l?x?u}. For the solution of this problem we propose an active set method that combines ideas from projected and nonmonotone Newton-type methods. It is based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7035cb1a3de0d8583c32a37cd4cf13f2
https://doi.org/10.1007/s10589-012-9506-7
https://doi.org/10.1007/s10589-012-9506-7
Publikováno v:
Computational optimization and applications 45 (2010): 311–352. doi:10.1007/s10589-008-9216-3
info:cnr-pdr/source/autori:Di Pillo, G.; Liuzzi, G.; Lucidi, S.; Palagi, L./titolo:A truncated Newton method in an augmented Lagrangian framework for nonlinear programming/doi:10.1007%2Fs10589-008-9216-3/rivista:Computational optimization and applications/anno:2010/pagina_da:311/pagina_a:352/intervallo_pagine:311–352/volume:45
info:cnr-pdr/source/autori:Di Pillo, G.; Liuzzi, G.; Lucidi, S.; Palagi, L./titolo:A truncated Newton method in an augmented Lagrangian framework for nonlinear programming/doi:10.1007%2Fs10589-008-9216-3/rivista:Computational optimization and applications/anno:2010/pagina_da:311/pagina_a:352/intervallo_pagine:311–352/volume:45
In this paper we propose a primal-dual algorithm for the solution of general nonlinear programming problems. The core of the method is a local algorithm which relies on a truncated procedure for the computation of a search direction, and is thus suit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43361f8dc48d8a5bb339725e13e387ea
https://doi.org/10.1007/s10589-008-9216-3
https://doi.org/10.1007/s10589-008-9216-3
Yield optimization is a challenging topic in electronic circuit design. Methods for Yield optimization based on Montecarlo analysis of a circuit whose behavior is reproduced by simulations usually require too many time expensive simulations to be eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______645::822c5400f49aef4be263e1e2c34c5d2e
http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/report/2015-03.pdf
http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/report/2015-03.pdf