Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
نویسندگان
چکیده
منابع مشابه
Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
The problem of minimizing the sum of nonsmooth, convex objective functions defined on a real Hilbert space over the intersection of fixed point sets of nonexpansive mappings, onto which the projections cannot be efficiently computed, is considered. The use of proximal point algorithms that use the proximity operators of the objective functions and incremental optimization techniques is proposed...
متن کاملA Proximal Point Method for Nonsmooth Convex Optimization Problems in Banach Spaces
In this paper we show the weak convergence and stability of the proximal point method when applied to the constrained convex optimization problem in uniformly convex and uniformly smooth Banach spaces. In addition, we establish a nonasymptotic estimate of convergence rate of the sequence of functional values for the unconstrained case. This estimate depends on a geometric characteristic of the ...
متن کاملDual convergence for penalty proximal point algorithms in convex programming
We consider an implicit iterative method in convex programming which combines inexact variants of the proximal point algorithm, with parametric penalty functions. We investigate a multiplier sequence which is explicitly computed in terms of the primal sequence generated by the iterative method, providing some conditions on the parameters in order to ensure convergence towards a particular dual ...
متن کاملSome fixed point theorems and common fixed point theorem in log-convex structure
Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.
متن کاملAugmented Lagrangian Methods and Proximal Point Methods for Convex Optimization
We present a review of the classical proximal point method for nding zeroes of maximal monotone operators, and its application to augmented Lagrangian methods, including a rather complete convergence analysis. Next we discuss the generalized proximal point methods, either with Bregman distances or -divergences, which in turn give raise to a family of generalized augmented Lagrangians, as smooth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2016
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2016.02.057