Two new weak constraint qualifications and applications
We present two new constraint qualifications (CQs) that are weaker than the recently introduced relaxed constant positive linear dependence (RCPLD) CQ. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear dependence locally. A major o...
Guardado en:
| Autores principales: | Andreani, Roberto, Haeser, Gabriel, Schuverdt, María Laura, Silva, Paulo J. S. |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2012
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/96342 https://ri.conicet.gov.ar/11336/80535 https://epubs.siam.org/doi/10.1137/110843939 |
| Aporte de: |
Ejemplares similares
-
Repair algorithms and penalty functions to handling constraints in an evolutionary scheduling
por: Villagra, Andrea, et al.
Publicado: (2010) -
National qualification systems integration using ontologies
por: Cubillos, Claudio, et al.
Publicado: (2006) -
Ackermannian and primitive-recursive bounds with Dickson's Lemma
por: Figueira, D., et al. -
Ackermannian and primitive-recursive bounds with Dickson's Lemma
por: Figueira, Diego Federico, et al.
Publicado: (2011) -
Qualifications frameworks for the European Higher Education Area. A new instrumentalism or "much ado about nothing"?
por: Berit Karseth
Publicado: (2010)