Trust Region Method
Mostrando 1-11 de 11 artigos, teses e dissertações.
-
1. Collaboration in cluster-based firms as a source of competitive advantage: evidence from a footwear cluster
Abstract Paper aims To analyze the potential to generate relational rents in cluster-based firms located in the Northeast region of Brazil. Originality We developed a conceptual framework based on the primary sources of relational rents considering the characteristics of clusters. Research method An explorative case study. Data were collected mainly by
Prod.. Publicado em: 14/02/2019
-
2. Uma nova abordagem para resolução de problemas de fluxo de carga com variáveis discretas / A new approach for solving load flow problems with discrete variables
Este trabalho apresenta uma nova abordagem para a modelagem e resolução de problemas de fluxo de carga em sistemas elétricos de potência. O modelo proposto é formado simultaneamente pelo conjunto de equações não lineares que representam as restrições de carga do problema e por restrições de complementaridade associadas com as restrições de oper
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 07/05/2012
-
3. A new double trust regions SQP method without a penalty function or a filter
A new trust-region SQP method for equality constrained optimization is considered. This method avoids using a penalty function or a filter, and yet can be globally convergent to first-order critical points under some reasonable assumptions. Each SQP step is composed of a normal step and a tangential step for which different trust regions are applied in the s
Comput. Appl. Math.. Publicado em: 2012
-
4. Solving the dual subproblem of the Method of Moving Asymptotes using a trust-region scheme
An alternative strategy to solve the subproblems of the Method of Moving Asymptotes (MMA) is presented, based on a trust-region scheme applied to the dual of the MMA subproblem. At each iteration, the objective function of the dual problem is approximated by a regularized spectral model. A globally convergent modification to the MMA is also suggested, in whi
Computational & Applied Mathematics. Publicado em: 2011
-
5. Active-set strategy in Powell's method for optimization without derivatives
In this article we present an algorithm for solving bound constrained optimization problems without derivatives based on Powell's method [38] for derivative-free optimization. First we consider the unconstrained optimization problem. At each iteration a quadratic interpolation model of the objective function is constructed around the current iterate and this
Computational & Applied Mathematics. Publicado em: 2011
-
6. Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search
A trust-region method with two subproblems and backtracking line search for solving unconstrained optimization is proposed. At every iteration, we use the truncated conjugate gradient method or its variation to solve one of the two subproblems approximately. Backtracking line search is carried out when the trust-region trail step fails. We show that this met
Computational & Applied Mathematics. Publicado em: 2010-06
-
7. A new algorithm of nonlinear conjugate gradient method with strong convergence
The nonlinear conjugate gradient method is a very useful technique for solving large scale minimization problems and has wide applications in many fields. In this paper, we present a new algorithm of nonlinear conjugate gradient method with strong convergence for unconstrained minimization problems. The new algorithm can generate an adequate trust region rad
Computational & Applied Mathematics. Publicado em: 2008
-
8. Um metodo Newton-Inexato com estrategia hibrida para globalização / A Newton-Inexact algorithm with a hybrid method for globalization
The main objective of this work is to propose a hybrid globalization strategie for inexact-Newton method. Globalization strategies are based on line search or trust region procedures. In this work, we choose a hybrid strategy which involves a cycle of line search and a variation of Powell dogleg trust region. For solving the linear systems we chose the GMRES
Publicado em: 2007
-
9. An augmented Lagrangian SQP method for solving some special class of nonlinear semi-definite programming problems
In this paper, we consider a special class of nonlinear semi-definite programming problems that represents the fixed order H2/H¥ synthesis problem. An augmented Lagrangian sequential quadratic programming method combined with a trust region globalization strategy is described, taking advantage of the problem structure and using inex
Computational & Applied Mathematics. Publicado em: 2005-12
-
10. Viabilidade em programação não-linear : restauração e aplicações / Nonlinear programming feasibility: restoration and applications
Abstract Robust and numerically feasible algorithms for solving optimization problems have been demanded for solving practice problems that appear in Engineering, Chemistry, Physics and others. This work present a new globally convergent method based on trust regions for solving box-constrained underdetermined nonlinear systems (more unknowns than equations)
Publicado em: 2005
-
11. Penalização exata com subproblemas restritos
We present the classical results for the exact and the exterior penalty problems. We extend the classic exact penalty function theorem for the case where the penalty subproblems remain constrained. We introduce an algorithm for solving nonlinear programming problems based on the L1 exact penalty function for which only the nonlinear constraints are penalized
Publicado em: 1998