• No results found

[PDF] Top 20 Strong convergence of a modified proximal algorithm for solving the lasso

Has 10000 "Strong convergence of a modified proximal algorithm for solving the lasso" found on our website. Below are the top 20 most common "Strong convergence of a modified proximal algorithm for solving the lasso".

Strong convergence of a modified proximal algorithm for solving the lasso

Strong convergence of a modified proximal algorithm for solving the lasso

... iterative algorithm (.), we propose a modified formulation of the proximal algorithm ...the algorithm we propose can obtain strong ...this algorithm to solve the lasso ... See full document

15

Iterative Approaches to Find Zeros of Maximal Monotone Operators by Hybrid Approximate Proximal Point Methods

Iterative Approaches to Find Zeros of Maximal Monotone Operators by Hybrid Approximate Proximal Point Methods

... inexact proximal point method 1.3 in order to strong convergence to be ...to modified approximate proximal point algorithms in Hilbert spaces; that is, they established strong ... See full document

18

Modified Proximal point algorithms for finding a zero point of maximal monotone operators, generalized mixed equilibrium problems and variational inequalities

Modified Proximal point algorithms for finding a zero point of maximal monotone operators, generalized mixed equilibrium problems and variational inequalities

... a strong convergence theorem for finding a common element of the set of solutions of mixed equilibrium problems, the set of solution of the varia- tional inequality problem, the fixed point set of ... See full document

21

Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem

Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem

... two strong convergence theorems as regards this ...give strong convergence theorems as regards the split feasibility problem with modified CQ method, strong convergence theorem as ... See full document

23

Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis

Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis

... the proximal split feasibility problems. For solving the problems, we present new self-adaptive algorithms with the regularization ...some strong convergence theorems for the proximal ... See full document

13

Strong convergence of a parallel iterative algorithm in a reflexive Banach space

Strong convergence of a parallel iterative algorithm in a reflexive Banach space

... for solving zero points of accretive operators is the proximal point algorithms, which have been studied by many authors; see [–] and the references ... See full document

9

Strong convergence of a proximal-type algorithm for an occasionally pseudomonotone operator in Banach spaces

Strong convergence of a proximal-type algorithm for an occasionally pseudomonotone operator in Banach spaces

... of solving  ∈ Tx is the proximal point ...Rockafellar’s proximal point algorithm generates, for any starting point x  = x ∈ H, a sequence {x n } in H by the ... See full document

13

Convergence of the Proximal Point Method for Metrically Regular
Mappings

Convergence of the Proximal Point Method for Metrically Regular Mappings

... the proximal point algorithm, and have also found applications of this method to specific variational ...the algorithm for solving inclusions involving monotone mappings, and specifically, on ... See full document

8

The modified proximal point algorithm in Hadamard spaces

The modified proximal point algorithm in Hadamard spaces

... many convergence results by PPA for solving optimization problems have been extended from the classical linear spaces such as Euclidean spaces,Hilbert spaces and Ba- nach spaces to the setting of manifolds ... See full document

10

Hybrid Proximal Point Methods for Zeros of Maximal Monotone Operators, Variational Inequalities and Mixed Equilibrium Problems

Hybrid Proximal Point Methods for Zeros of Maximal Monotone Operators, Variational Inequalities and Mixed Equilibrium Problems

... prove strong and weak convergence theorems of modified hybrid proximal-point algorithms for finding a common element of the zero point of a maximal monotone operator, the set of solutions of ... See full document

32

Strong and Weak Convergence of the Modified Proximal Point Algorithms in Hilbert Space

Strong and Weak Convergence of the Modified Proximal Point Algorithms in Hilbert Space

... Rochafellar’s proximal point algorithm ...a modified proximal point algorithm by an additional projection at each step of ...the convergence of the sequence {x k } generated by ... See full document

11

Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm

Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm

... The proximal gradient algorithm is an appealing approach in finding solutions of non-smooth composite optimization problems, which may only has weak convergence in the infinite-dimensional ...modified ... See full document

15

Iterative approximation of solutions for proximal split feasibility problems

Iterative approximation of solutions for proximal split feasibility problems

... type algorithm for solving proximal split feasibility problems and prove the strong convergence of the sequences generated by our iterative schemes in Hilbert ...prove strong ... See full document

18

Modified Hybrid Algorithm for a Family of Quasi--Asymptotically Nonexpansive Mappings

Modified Hybrid Algorithm for a Family of Quasi--Asymptotically Nonexpansive Mappings

... The class of asymptotically nonexpansive mappings was introduced by Goebel and Kirk 1 in 1972. They proved that if C is a nonempty bounded closed convex subset of a uniformly convex Banach space E, then every ... See full document

15

Regularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in Banach spaces

Regularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in Banach spaces

... regularization proximal point algorithm to solve the pro- blem of finding a common fixed point of a finite family of nonexpansive self-mappings in a uniformly convex and uniformly smooth Banach space ... See full document

10

Approximating a common fixed point for finite family of demimetric mappings in CAT(0) space

Approximating a common fixed point for finite family of demimetric mappings in CAT(0) space

... a strong convergence theorem for finding a common element of the set of common fixed points for a finite family of these new mappings and the set of common solutions of variational inequality problems for a ... See full document

16

The split common fixed point problem for infinite families of demicontractive mappings

The split common fixed point problem for infinite families of demicontractive mappings

... new algorithm for solving the split common fixed point problem for infinite families of demicontractive ...mappings. Strong convergence of the proposed method is established under suitable ... See full document

21

Strong convergence of a modified iterative algorithm for hierarchical fixed point problems and variational inequalities

Strong convergence of a modified iterative algorithm for hierarchical fixed point problems and variational inequalities

... It is well known that the iterative methods for finding hierarchical fixed points of non- expansive mappings can also be used to solve a convex minimization problem; see, for example, [,[r] ... See full document

9

The hybrid steepest descent method for solving variational inequality over triple hierarchical problems

The hybrid steepest descent method for solving variational inequality over triple hierarchical problems

... explicit algorithm is introduced to solve the monotone variational inequality over a triple hierarchical ...The strong convergence for the proposed algorithm to the solution is guaranteed ... See full document

17

Strong Convergence of a Modified Halpern's Iteration for Nonexpansive Mappings

Strong Convergence of a Modified Halpern's Iteration for Nonexpansive Mappings

... The purpose of this paper is to present a significant answer to the above open question. we will show that the sequence {α n } satisfying the conditions C1 and C2 is sufficient to guarantee the strong ... See full document

9

Show all 10000 documents...