A new method is introduced for solving constrained optimization problems in which the derivatives of the constraints are available but the derivatives of the objective function are not. the method is based on the inexact restoration framework, by means of which each iteration is divided in two phases. in the first phase one considers only the constraints, in order to improve feasibility. in the second phase one minimizes a suitable objective function subject to a linear approximation of the constraints. the second phase must be solved using derivative-free methods. An algorithm introduced recently by Kolda, Lewis, and Torczon for linearly constrained derivative-free optimization is employed for this purpose. Under usual assumptions, converg...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
Abstract. In this paper we consider inequality constrained nonlinear optimization problems where the...
In this paper we consider constrained optimization problems where both the objective and constraint ...
A derivative-free optimization method is proposed for solving a general nonlinear programming proble...
An inexact restoration derivative-free filter method for nonlinear programming is introduced in this...
An inexact restoration derivative-free filter method for nonlinear programming is introduced in this...
Inexact Restoration methods have been proved to be effective to solve constrained optimization probl...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
Inexact Restoration methods have been proved to be effective to solve constrained optimization probl...
In this paper, we propose new linesearch-based methods for nonsmooth optimization problems when firs...
In this paper, we propose new linesearch-based methods for nonsmooth optimization problems when firs...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
In this paper, we propose new linesearch-based methods for nonsmooth optimization problems when firs...
Orientador: José Mario Martínez PérezTese (doutorado) - Universidade Estadual de Campinas, Instituto...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
Abstract. In this paper we consider inequality constrained nonlinear optimization problems where the...
In this paper we consider constrained optimization problems where both the objective and constraint ...
A derivative-free optimization method is proposed for solving a general nonlinear programming proble...
An inexact restoration derivative-free filter method for nonlinear programming is introduced in this...
An inexact restoration derivative-free filter method for nonlinear programming is introduced in this...
Inexact Restoration methods have been proved to be effective to solve constrained optimization probl...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
Inexact Restoration methods have been proved to be effective to solve constrained optimization probl...
In this paper, we propose new linesearch-based methods for nonsmooth optimization problems when firs...
In this paper, we propose new linesearch-based methods for nonsmooth optimization problems when firs...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
In this paper, we propose new linesearch-based methods for nonsmooth optimization problems when firs...
Orientador: José Mario Martínez PérezTese (doutorado) - Universidade Estadual de Campinas, Instituto...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do...
Abstract. In this paper we consider inequality constrained nonlinear optimization problems where the...
In this paper we consider constrained optimization problems where both the objective and constraint ...