8 citations · 29 across the 50 of their papers we have counts for
7 papers · 1 filter
Proximal Point Method for Vector Optimization on Hadamard Manifolds
G. C. Bento, O. P. Ferreira, Y. R. L. Pereira
In this paper, we extend the proximal point algorithm for vector optimization from the Euclidean space to the Riemannian context. Under suitable assumptions on the objective functi…
Inexact Newton's method to nonlinear functions with values in a cone
O. P. Ferreira, G. N. Silva
The problem of finding a solution of nonlinear inclusion problems in Banach space is considered in this paper. Using convex optimization techniques introduced by Robinson (Numer. M…
A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
J. G. Barrios, J. Y. Bello Cruz, O. P. Ferreira +1
In this paper a special piecewise linear system is studied. It is shown that, under a mild assumption, the semi-smooth Newton method applied to this system is well defined and the…
On the global convergence of the inexact semi-smooth Newton method for absolute value equation
J. Y. Bello Cruz, O. P. Ferreira, L. F. Prudente
In this paper, we investigate global convergence properties of the inexact nonsmooth Newton method for solving the system of absolute value equations (AVE). Global -linear conve…
Robust Kantorovich's theorem on Newton's method under majorant condition in Riemannian Manifolds
Tibério Bittencourt, Orizon P. Ferreira
A robust affine invariant version of Kantorovich's theorem on Newton's method, for finding a zero of a differentiable vector field defined on a complete Riemannian manifold, is pre…
Projection onto simplicial cones by Picard's method
Jorge Barrios, Orizon P. Ferreira, Sándor Z. Németh
By using Moreau's decomposition theorem for projecting onto cones, the problem of projecting onto a simplicial cone is reduced to finding the unique solution of a nonsmooth system…
A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint
J. G. Barrios, O. P. Ferreira, S. Z. Németh
In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem…