Constraint Qualifications
Mostrando 1-4 de 4 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. 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
-
3. A filter SQP algorithm without a feasibility restoration phase
In this paper we present a filter sequential quadratic programming (SQP) algorithm for solving constrained optimization problems. This algorithm is based on the modified quadratic programming (QP) subproblem proposed by Burke and Han, and it can avoid the infeasibility of the QP subproblem at each iteration. Compared with other filter SQP algorithms, our alg
Computational & Applied Mathematics. Publicado em: 2009
-
4. Convex programs having some linear constraints
The problem of concern is the minimization of a convex function over a normed space (such as a Hilbert space) subject to the constraints that a number of other convex functions are not positive. As is well known, there is a dual maximization problem involving Lagrange multipliers. Some of the constraint functions are linear, and so the Uzawa, Stoer, and Witz