Cargando…
Analysis of Interior-Point Paths
Infeasible-interior-point paths are the main tools in interior-point methods for solving many kinds of optimization problems. These paths are usually parametrized by a penalty-parameter r ↓ 0 and further parameters describing their off-centrality and infeasiblilty. Starting with an early result of C...
Autor principal: | Stoer, J. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
[Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology
2006
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4662503/ https://www.ncbi.nlm.nih.gov/pubmed/27274925 http://dx.doi.org/10.6028/jres.111.013 |
Ejemplares similares
-
Interior point algorithms: theory and analysis
por: Ye, Yinyu
Publicado: (2011) -
Interior point methods for linear optimization /
por: Roos, Cornelis, 1941-
Publicado: (2006) -
Interior point methods for linear optimization
por: Roos, Cornelis, et al.
Publicado: (2005) -
Interior point methods of mathematical programming
por: Terlaky, Tamas
Publicado: (1996) -
Interior-point polynominal algoritms in convex programming
por: Nesterov, IU. E.
Publicado: (1994)