| Full text | |
| Author(s): |
de Oliveira, Valeriano A.
[1]
;
dos Santos, Lucelina B.
[2]
;
Osuna-Gomez, Rafaela
[3]
;
Rojas-Medar, Marko A.
[4]
Total Authors: 4
|
| Affiliation: | [1] UNESP Univ Estadual Paulista, Inst Biociencias Letras & Ciencias Exatas, BR-15054000 Sao Jose Do Rio Preto, SP - Brazil
[2] Univ Fed Parana, Dept Matemat, Ctr Politecn, Setor Ciencias Exatas, BR-81531990 Curitiba, Parana - Brazil
[3] Univ Seville, Dept Estadist & Invest Operat, Fac Matemat, E-41012 Seville - Spain
[4] Univ Bio Bio, Fac Ciencias, Dept Ciencias Basicas, GMA, Chillan - Chile
Total Affiliations: 4
|
| Document type: | Journal article |
| Source: | Optimization Letters; v. 9, n. 6, p. 1131-1147, AUG 2015. |
| Web of Science Citations: | 2 |
| Abstract | |
An infinite programming problem consists in minimizing a functional defined on a real Banach space under an infinite number of constraints. The main purpose of this article is to provide sufficient conditions of optimality under generalized convexity assumptions. Such conditions are necessarily satisfied when the problem possesses the property that every stationary point is a global minimizer. (AU) | |
| FAPESP's process: | 11/01977-2 - Contributions in optimal control theory |
| Grantee: | Valeriano Antunes de Oliveira |
| Support Opportunities: | Regular Research Grants |