Métodos de Pontos Interiores Aplicados ao Problema de Regressão pela Norma Lp
DOI:
https://doi.org/10.5540/tema.2004.05.02.0269Abstract
Os métodos de pontos interiores barreira logarítmica são desenvolvidos para o problema de regressão pela norma Lp e a estrutura matricial resultante é explorada objetivando uma implementação eficiente. Alguns conceitos dos métodos de pontos interiores são apresentados e um método de convergência quadrática existente é descrito. As implementações dos métodos de pontos interiores desenvolvidos são comparadas com o método já existente obtendo melhor desempenho computacional para problemas de grande porte.References
[1] T.F. Coleman e Y. Li, A globally and quadratically convergent affine scaling method for linear l1 problems, Math. Programming, 56 (1992), 189-222.
A. Dax e B. Berkowitz, Column relaxation methods for least norm problems, SIAM J. Sci. Stat. Comput., 11 (1990), 975-989.
A.S. El-Bakry, R.A. Tapia, T. Tsuchiya e Y. Zhang, On the formulation and the theory of the Newton interior-point method for nonlinear programming, Journal of Optimization Theory and Applications, 89 (1996), 507-541.
Y. Li, A globally convergent method for lp problems, SIAM J. Optimization, 3 (1993), 609-629.
S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM Journal on Optimization, 2 (1992), 575-601.
G. Merle e H. Sp¨acth, Computational experience with discrete lp approximation, Computing, 12 (1974), 315-321.
R.D.C. Monteiro, I. Adler e M.G.C Resende, A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension, Mathematics of Operations Research, 15 (1990), 191-214.
A.R.L. Oliveira e C. Lyra, Interior point methods for the polynomial L1 fitting problems, Internacional Transactions in Operational Research, 11 (2004), 309-322.
A.R.L. Oliveira, M.A. Nascimento e C. Lyra, Efficient implementation and benchmark of interior point methods for the polynomial L1 fitting problems, Statistics & Data Analysis, 35 (2000), 119-135.
D.F. Shanno e R.J. Vanderbei, Interior point methods for nonconvex nonlinear programming: Orderings and higher-order methods, Mathematical Programming, 87 (2000), 303-316.
S.J. Wright, “Primal-Dual Interior-Point Methods”, SIAM Publications, SIAM Philadelphia, PA, USA, 1996.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.