{"id":{"repo_id":"brazil-uerj","oai_identifier":"oai:pantheon.ufrj.br:11422/4251"},"canonical_url":"https://search.dev.ndltd.org/etd/brazil-uerj/oai:pantheon.ufrj.br:11422/4251","repository":{"repo_id":"brazil-uerj","name":"Brazil UERJ","base_url":"https://pantheon.ufrj.br/oai/request"},"display":{"title":"O método de direções viáveis em duas estapas para programação não-linear e aplicações a programação quadrática","abstract":"Presents the computational implementation of the two-steps feasible directions algorithm for non-linear constrained optimization. It' s stated an assimptotic convergence method for quadratic programming, based on the sarne ideas. As a consequence of the computational implementation, a constrained line-search·procedure is developed. To avoid ili-conditionning and accelerate the convergence rate, new techniques are developed and tested by means of classical problems. For both methods, many versions that have different convergence rates are presented. Versions which use quasi-Newton techniques have superlinear convergence rate.","abstract_html":"Presents the computational implementation of the two-steps feasible directions algorithm for non-linear constrained optimization. It' s stated an assimptotic convergence method for quadratic programming, based on the sarne ideas. As a consequence of the computational implementation, a constrained line-search·procedure is developed. To avoid ili-conditionning and accelerate the convergence rate, new techniques are developed and tested by means of classical problems. For both methods, many versions that have different convergence rates are presented. Versions which use quasi-Newton techniques have superlinear convergence rate.","abstract_has_math":false,"creators":["Carvalho, Luis Alfredo Vidal de"],"institution":"Universidade Federal do Rio de Janeiro","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Norman, José Hirskovits"],"committee_chairs":[],"committee_members":[],"year":1984,"date_issued":"1984","date_published":"1984","updated_at":"2026-07-24T01:16:15Z","subjects":["Projeto mecânico","Dinâmica de máquinas","Programação não linear"],"languages":["por"],"rights":["Acesso Aberto"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11422/4251","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Norman, José Hirskovits"]},{"key":"dc:creator","label":"Author","values":["Carvalho, Luis Alfredo Vidal de"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-07-05T15:57:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-05-16T03:05:09Z"]},{"key":"dc:date.issued","label":"Date","values":["1984"]},{"key":"dc:publisher","label":"Institution","values":["Universidade Federal do Rio de Janeiro"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia"]},{"key":"dc:type","label":"Dc Type","values":["Dissertação"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Projeto mecânico","Dinâmica de máquinas","Programação não linear"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["por"]},{"key":"dc:rights","label":"Dc Rights","values":["Acesso Aberto"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11422/4251"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Presents the computational implementation of the two-steps feasible directions algorithm for non-linear constrained optimization. It' s stated an assimptotic convergence method for quadratic programming, based on the sarne ideas. As a consequence of the computational implementation, a constrained line-search·procedure is developed. To avoid ili-conditionning and accelerate the convergence rate, new techniques are developed and tested by means of classical problems. For both methods, many versions that have different convergence rates are presented. Versions which use quasi-Newton techniques have superlinear convergence rate."]},{"key":"dc:title","label":"Title","values":["O método de direções viáveis em duas estapas para programação não-linear e aplicações a programação quadrática"]}]}],"canonical_facts":{"dc:contributor.advisor":["Norman, José Hirskovits"],"dc:creator":["Carvalho, Luis Alfredo Vidal de"],"dc:date.accessioned":["2018-07-05T15:57:35Z"],"dc:date.available":["2026-05-16T03:05:09Z"],"dc:date.issued":["1984"],"dc:description.abstract":["Presents the computational implementation of the two-steps feasible directions algorithm for non-linear constrained optimization. It' s stated an assimptotic convergence method for quadratic programming, based on the sarne ideas. As a consequence of the computational implementation, a constrained line-search·procedure is developed. To avoid ili-conditionning and accelerate the convergence rate, new techniques are developed and tested by means of classical problems. For both methods, many versions that have different convergence rates are presented. Versions which use quasi-Newton techniques have superlinear convergence rate."],"dc:identifier.uri":["http://hdl.handle.net/11422/4251"],"dc:language":["por"],"dc:publisher":["Universidade Federal do Rio de Janeiro"],"dc:publisher.department":["Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia"],"dc:rights":["Acesso Aberto"],"dc:subject":["Projeto mecânico","Dinâmica de máquinas","Programação não linear"],"dc:title":["O método de direções viáveis em duas estapas para programação não-linear e aplicações a programação quadrática"],"dc:type":["Dissertação"]},"updated_at":"2026-07-24T01:16:15Z"}