Cargando…

Interior point approach to linear, quadratic and convex programming: algorithms and complexity

Detalles Bibliográficos
Autor principal: Hertog, D
Lenguaje:eng
Publicado: Springer 1994
Materias:
Acceso en línea:https://dx.doi.org/10.1007/978-94-011-1134-8
http://cds.cern.ch/record/1619841
_version_ 1780933058990440448
author Hertog, D
author_facet Hertog, D
author_sort Hertog, D
collection CERN
id cern-1619841
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1994
publisher Springer
record_format invenio
spelling cern-16198412021-04-21T21:54:30Zdoi:10.1007/978-94-011-1134-8http://cds.cern.ch/record/1619841engHertog, DInterior point approach to linear, quadratic and convex programming: algorithms and complexityMathematical Physics and MathematicsSpringeroai:cds.cern.ch:16198411994
spellingShingle Mathematical Physics and Mathematics
Hertog, D
Interior point approach to linear, quadratic and convex programming: algorithms and complexity
title Interior point approach to linear, quadratic and convex programming: algorithms and complexity
title_full Interior point approach to linear, quadratic and convex programming: algorithms and complexity
title_fullStr Interior point approach to linear, quadratic and convex programming: algorithms and complexity
title_full_unstemmed Interior point approach to linear, quadratic and convex programming: algorithms and complexity
title_short Interior point approach to linear, quadratic and convex programming: algorithms and complexity
title_sort interior point approach to linear, quadratic and convex programming: algorithms and complexity
topic Mathematical Physics and Mathematics
url https://dx.doi.org/10.1007/978-94-011-1134-8
http://cds.cern.ch/record/1619841
work_keys_str_mv AT hertogd interiorpointapproachtolinearquadraticandconvexprogrammingalgorithmsandcomplexity