Kkt Conditions
Mostrando 1-6 de 6 artigos, teses e dissertações.
-
1. CONSTANT RANK CONSTRAINT QUALIFICATIONS: A GEOMETRIC INTRODUCTION
Constraint qualifications (CQ) are assumptions on the algebraic description of the feasible set of an optimization problem that ensure that the KKT conditions hold at any local minimum. In this work we show that constraint qualifications based on the notion of constant rank can be understood as assumptions that ensure that the polar of the linear approximati
Pesqui. Oper.. Publicado em: 2014-12
-
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. On the use of the Spectral Projected Gradient method for Support Vector Machines
In this work we study how to solve the SVM optimization problem by using the Spectral Projected Gradient (SPG) method with three different strategies for computing the projection onto the constrained set. One of the strategies is based on Dykstra's alternating projection algorithm since there is not a mathematical equation for the projection onto the whole c
Computational & Applied Mathematics. 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. Programação em dois níveis: reformulação utilizando as condições KKT / Bilevel programming: reformulation using KKT conditions.
Em um problema de natureza hierárquica, o nível mais influente toma certas decisões que afetam o comportamento dos níveis inferiores. Cada decisão do nível mais influente é considerada como fixa pelos níveis inferiores, que, com tais informações, tomam decisões que maximizam seus objetivos. Essas decisões podem influenciar os resultados obtidos p
Publicado em: 2008
-
6. The STK2 gene, which encodes a putative Ser/Thr protein kinase, is required for high-affinity spermidine transport in Saccharomyces cerevisiae.
Eukaryotic polyamine transport systems have not yet been characterized at the molecular level. We have used transposon mutagenesis to identify genes controlling polyamine transport in Saccharomyces cerevisiae. A haploid yeast strain was transformed with a genomic minitransposon- and lacZ-tagged library, and positive clones were selected for growth resistance