Constraint Qualification
Mostrando 1-6 de 6 artigos, teses e dissertações.
-
1. A Note on the McCormick Second-Order Constraint Qualification
ABSTRACT The study of optimality conditions and constraint qualification is a key topic in nonlinear optimization. In this work, we present a reformulation of the well-known second-order constraint qualification described by McCormick in 17. This reformulation is based on the use of feasible arcs, but is independent of Lagrange multipliers. Using such a refo
Trends in Computational and Applied Mathematics. Publicado em: 2022
-
2. Derivative-free methods for nonlinear programming with general lower-level constraints
Augmented Lagrangian methods for derivative-free continuous optimization with constraints are introduced in this paper. The algorithms inherit the convergence results obtained by Andreani, Birgin, Martínez and Schuverdt for the case in which analytic derivatives exist and are available. In particular, feasible limit points satisfy KKT conditions under the C
Comput. Appl. Math.. Publicado em: 2011
-
3. Sequential quadratic programming and constraint qualification / Programação quadratica sequencial e condições de qualificação
In the context of constrained optimization problems, we face the optimality conditions and also constraint qualification. Our aim is to study with details several constraint qualification, highlighting the constant positive linear dependence condition, and its influence in Sequential Quadratic Programming algorithms convergence. The relevance of this study i
Publicado em: 2009
-
4. Sequential optimality conditions / Condições sequenciais de otimalidade
We study optimality conditions generated by the external penalty, internal penalty, internal-external penalty and inexact restoration algorithms, and we show relations with the CPLD, a new constraint qualification strictly weaker than the Mangasarian-Fromovitz condition and the constant rank condition of Janin. We extend the result of the classical Carathéo
Publicado em: 2009
-
5. Derivative-free nonlinear programming / Programação não linear sem derivadas
We propose in this work a derivative-free Augmented Lagrangian algorithm for the general problem of optimization. We consider the method due to Andreani, Birgin, Martínez and Schuverdt, eliminating the derivative computations in the algorithm by making suitable modifications on the stopping criterion. The good theoretical results of the method were mantaine
Publicado em: 2009
-
6. Verificação do grau de conhecimento de cirurgiões-dentistas sobre os aspectos eticos e legais dos insucessos e contra indicações de implantes osseointegrados
Osseointegrated implants and prostheses installed on them have been used in substitution of lost teeth. The index of success in Implantodonty has increased with the discovery of the osseointegration by Professor Branemark, and since then, some systems and implants brands have been developed. However, the lack of observation by Dental Surgeons who work in thi
Publicado em: 2003