Abstract A method introduced recently by Bellavia, Macconi and Morini for solving square nonlinear systems with bounds is modified and extended to cope with the underdetermined case. The algorithm produces a sequence of interior iterates and is based on globalization techniques due to Coleman and Li. Global and local convergence results are proved and numerical experiments are presented
International audienceIn nonlinear optimization, interior point methods, also called primal-dual met...
International audienceIn nonlinear optimization, interior point methods, also called primal-dual met...
none3Abstract Ill-posed problems are numerically underdetermined. It is therefore often beneficial ...
AbstractA method introduced recently by Bellavia, Macconi and Morini for solving square nonlinear sy...
AbstractA method introduced recently by Bellavia, Macconi and Morini for solving square nonlinear sy...
A derivative-free iterative method for solving bound-constrained underdetermined nonlinear systems i...
none3An iterative method for solving bound-constrained underdetermined nonlinear systems is presente...
In this research, we discuss linear and nonlinear programming problems and methods. We have implemen...
An iterative method for solving bound-constrained underdetermined nonlinear systems is presented. Th...
An iterative method for solving bound-constrained underdetermined nonlinear systems is presented. Th...
In this paper, we describe a variant of the Newton Interior{Point method in [8] for nonlinear progra...
We study the local convergence of a primal-dual interior point method for nonlinear programming. A l...
We develop and compare multilevel algorithms for solving constrained nonlinear variational problems ...
The contribution contains a short description of interior point s methods for nonconvex nonlinear p...
In the first part of this research we consider a linesearch globalization of the local primal-dual i...
International audienceIn nonlinear optimization, interior point methods, also called primal-dual met...
International audienceIn nonlinear optimization, interior point methods, also called primal-dual met...
none3Abstract Ill-posed problems are numerically underdetermined. It is therefore often beneficial ...
AbstractA method introduced recently by Bellavia, Macconi and Morini for solving square nonlinear sy...
AbstractA method introduced recently by Bellavia, Macconi and Morini for solving square nonlinear sy...
A derivative-free iterative method for solving bound-constrained underdetermined nonlinear systems i...
none3An iterative method for solving bound-constrained underdetermined nonlinear systems is presente...
In this research, we discuss linear and nonlinear programming problems and methods. We have implemen...
An iterative method for solving bound-constrained underdetermined nonlinear systems is presented. Th...
An iterative method for solving bound-constrained underdetermined nonlinear systems is presented. Th...
In this paper, we describe a variant of the Newton Interior{Point method in [8] for nonlinear progra...
We study the local convergence of a primal-dual interior point method for nonlinear programming. A l...
We develop and compare multilevel algorithms for solving constrained nonlinear variational problems ...
The contribution contains a short description of interior point s methods for nonconvex nonlinear p...
In the first part of this research we consider a linesearch globalization of the local primal-dual i...
International audienceIn nonlinear optimization, interior point methods, also called primal-dual met...
International audienceIn nonlinear optimization, interior point methods, also called primal-dual met...
none3Abstract Ill-posed problems are numerically underdetermined. It is therefore often beneficial ...