A unified hybrid iterative method for hierarchical minimization problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proximal Method with Penalization for Split Hierarchical Minimization Problems

In this paper we consider a splitting proximal algorithm with penalization for minimizing a finite sum of proper, convex and lower semicontinuous functions subject to the set of minimizers of another proper, convex and lower semicontinuous function. We show convergences of the generated sequence of iterates to an optimal solution of the considered hierarchical minimization problem. As an illust...

متن کامل

Iterative Hierarchical Optimization for Misspecified Problems (IHOMP)

Reinforcement Learning (RL) aims to learn an optimal policy for a Markov Decision Process (MDP). For complex, high-dimensional MDPs, it may only be feasible to represent the policy with function approximation. If the policy representation used cannot represent good policies, the problem is misspecified and the learned policy may be far from optimal. We introduce IHOMP as an approach for solving...

متن کامل

A Unified Hybrid Iterative Method for Solving Variational Inequalities Involving Generalized Pseudocontractive Mappings

We study in this paper the existence and approximation of solutions of variational inequalities involving generalized pseudo-contractive mappings in Banach spaces. The convergence analysis of a proposed hybrid iterative method for approximating common zeros or fixed points of a possibly infinitely countable or uncountable family of such operators will be conducted within the conceptual framewor...

متن کامل

A General Iterative Method for Constrained Convex Minimization Problems in Hilbert Spaces

It is well known that the gradient-projection algorithm plays an important role in solving constrained convex minimization problems. In this paper, based on Xu’s method [Xu, H. K.: Averaged mappings and the gradient-projection algorithm, J. Optim. Theory Appl. 150, 360-378(2011)], we use the idea of regularization to establish implicit and explicit iterative methods for finding the approximate ...

متن کامل

A Decoupled Iterative Method for Mixed Problems

where ΓD and ΓN are assumed to partition the boundary of Ω, and ~ν(~x) denotes the outward unit normal from Ω at ~x ∈ ΓN . Additionally we assume that each connected component of ΓN is simply connected. The numerical treatment of (1 3) involves the solution of usually very large indefinite linear equation systems. In this paper we describe a very efficient and practicable iterative method to so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2013

ISSN: 0377-0427

DOI: 10.1016/j.cam.2013.04.018