Terminal de consulta web

Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and high-order models

Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and high-order models

E. G. Birgin, J. L. Gardenghi, J. M. Martínez, S. A. Santos, Ph. L. Toint

ARTIGO

Inglês

The evaluation complexity of general nonlinear, possibly nonconvex, constrained optimization is analyzed. It is shown that, under suitable smoothness conditions, an epsilon-approximate first-order critical point of the problem can be computed in order O(epsilon(1-2(p+1)/p)) evaluations of the... Ver mais

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQ

304032/2010-7; 309517/2014-1; 303750/2014-6; 490326/2013-7

FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP

2010/10133-0; 2013/03447-6; 2013/05475-7; 2013/07375-0; 2013/23494-9

aberto

Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and high-order models

E. G. Birgin, J. L. Gardenghi, J. M. Martínez, S. A. Santos, Ph. L. Toint

										

Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and high-order models

E. G. Birgin, J. L. Gardenghi, J. M. Martínez, S. A. Santos, Ph. L. Toint

    Fontes

    SIAM journal on optimization

    Vol. 26, no. 2 (2016), p. 951-967