• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
10.11606/D.45.2014.tde-11072014-084756
Document
Author
Full name
John Lenon Cardoso Gardenghi
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 2014
Supervisor
Committee
Birgin, Ernesto Julian Goldberg (President)
Perez, José Mario Martinez
Santos, Sandra Augusta
Title in Portuguese
Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte
Keywords in Portuguese
busca linear
pontos interiores viáveis
problemas de grande porte
programação não linear
restrições lineares
Abstract in Portuguese
Neste trabalho, propomos um método de pontos interiores para minimização com restrições lineares de grande porte. Este método explora a linearidade das restrições, partindo de um ponto viável e preservando a viabilidade dos iterandos. Apresentamos os principais resultados de convergência global, além de uma descrição rica em detalhes de uma implementação prática de todos os passos do método. Para atestar a implementação do método, exibimos uma ampla experimentação numérica, e uma análise comparativa com métodos bem difundidos na comunidade de otimização contínua.
Title in English
A feasible primal-dual interior-point method for large-scale linearly constrained minimization
Keywords in English
feasible interior-point
large-scale problems
line search
linear constraints
nonlinear programming
Abstract in English
In this work, we propose an interior-point method for large-scale linearly constrained optimization. This method explores the linearity of the constraints, starting from a feasible point and preserving the feasibility of the iterates. We present the main global convergence results, together with a rich description of the implementation details of all the steps of the method. To validate the implementation of the method, we present a wide set of numerical experiments and a comparative analysis with well known softwares of the continuous optimization community.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
JohnGardenghi_D.pdf (885.31 Kbytes)
Publishing Date
2014-08-05
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
Centro de Informática de São Carlos
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2020. All rights reserved.