A Cyclic Projection Algorithm Via Duality.
A Duality Theorem for Infinite Dimensional Improper Mathematical Programming Problems
A general maximum principle for optimization problems
A generalized hybrid steepest-descent method for variational inequalities in Banach spaces.
A generalized solution of a nonconvex minimization problem and its stability
A hybrid projection-proximal point algorithm.
A measure-theoretical max-flow-min-cut problem.
A new non-interior continuation method for -NCP based on a SSPM-function
In this paper, we consider a new non-interior continuation method for the solution of nonlinear complementarity problem with -function (-NCP). The proposed algorithm is based on a smoothing symmetric perturbed minimum function (SSPM-function), and one only needs to solve one system of linear equations and to perform only one Armijo-type line search at each iteration. The method is proved to possess global and local convergence under weaker conditions. Preliminary numerical results indicate that...
A Regularized Continuous Projection-Gradient Method of the Fourth Order
A remark on a complementarity problem in Banach space.
A topology over a set of systems
The systems of an arbitrary number of linear inequalities OVer a real locally convex space have been classified in three classes, namely: consistent, weakly inconsistent and strongly inconsistent, i.e. having ordinary solutions, weak solutions or notsolutions respectively. In this paper, the third type is divided in two classes: strict-strongly and quasi-strongly inconsistent and is given a topology over a quotient space of the set of systems over finite- dimensional spaces, that yields a set of...
Algorithme d'approximation interne de problèmes de point de selle avec contraintes via l'optimisation
Algunos resultados sobre sistemas de desigualdades lineales.
En este artículo aplicamos la condición de Mazur-Orlicz para extender a espacios normados algunos resultados de consistencia de desigualdades lineales (s.d.l.) en Rn. Asimismo, obtenemos condiciones para la consistencia de s.d.l. en un espacio localmente convexo, cuando las soluciones pertenecen a ciertos subconjuntos del dual topológico.
An adaptive parallel projection method for solving convex feasibility problems.
An application of the Hahn-Banach theorem in convex analysis
An inexact proximal-type method for the generalized variational inequality in Banach spaces.
An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces.
Applications of nonnegative operators to a class of optimization problems
Let X be a partially ordered real Banach space, a,b ∈ X with a ≤ b. Let ϕ be a bounded linear functional on X. We call X a Ben-Israel-Charnes space (or a B-C space) if the linear program defined by Maximize ϕ(x) subject to a ≤ x ≤ b has an optimal solution for any ϕ, a and b. Such problems arise naturally in solving a class of problems known as Interval Linear Programs. B-C spaces were introduced in the author's doctoral thesis and were subsequently studied in [8] and [9]. In this article, we review...
Approximation des optima de Pareto
Calcul des idéaux d'un ordonné fini