Quasi-Fejérian analysis of some optimization algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings
- Strong convergence of a modified Krasnoselski-Mann iterative algorithm for non-expansive mappings
- Weak convergence theorems on the split common fixed point problem for demicontractive continuous mappings
- A new method for split common fixed-point problem without priori knowledge of operator norms
- A projected subgradient algorithm for bilevel equilibrium problems and applications
- Iterative regularization via dual diagonal descent
- Modified Fejér sequences and applications
- Generalized Mann iterates for constructing fixed points in Hilbert spaces
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Reconstruction of functions from prescribed proximal points
- An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems
- Solving composite fixed point problems with block updates
- Alternating conditional gradient method for convex feasibility problems
- Forward-backward-half forward dynamical systems for monotone inclusion problems with application to v-GNE
- Sequential convergence of AdaGrad algorithm for smooth convex optimization
- Fast generalized Nash equilibrium seeking under partial-decision information
- Modified Krasnoselski-Mann iterative method for hierarchical fixed point problem and split mixed equilibrium problem
- Inertial KM-type extragradient scheme for solving a variational inequality and a hierarchical fixed point problems
- Four-operator splitting via a forward-backward-half-forward algorithm with line search
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- Limits of eventual families of sets with application to algorithms for the common fixed point problem
- A real-time iterative projection scheme for solving the common fixed point problem and its applications
- Applying FISTA to optimization problems (with or) without minimizers
- Finitely convergent iterative methods with overrelaxations revisited
- Modified projected subgradient method for solving pseudomonotone equilibrium and fixed point problems in Banach spaces
- Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces
- Convergence rates of forward-Douglas-Rachford splitting method
- On an iterative method for finding a zero to the sum of two maximal monotone operators
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Viscosity method for hierarchical fixed point problems with an infinite family of nonexpansive nonself-mappings
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces
- Self-adaptive gradient projection algorithms for variational inequalities involving non-Lipschitz continuous operators
- Extrapolation algorithm for affine-convex feasibility problems
- Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
- Directional asymptotics of Fejér monotone sequences
- Primal-dual splittings as fixed point iterations in the range of linear operators
- A subgradient method with non-monotone line search
- Almost sure convergence of the forward-backward-forward splitting algorithm
- Scaling techniques for -subgradient methods
- Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
- Opial-type theorems and the common fixed point problem
- Activity identification and local linear convergence of forward-backward-type methods
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Solutions of system of equilibrium and variational inequality problems on fixed points of infinite family of nonexpansive mappings
- On some steplength approaches for proximal algorithms
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- Convergence rates with inexact non-expansive operators
- Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Single projection Kaczmarz extended algorithms
- Envelope stepsize control for iterative algorithms based on Fejér processes with attractants
- Approximating fixed points of amenable semigroup and infinite family of nonexpansive mappings and solving systems of variational inequalities and systems of equilibrium problems
- Coupling the gradient method with a general exterior penalization scheme for convex minimization
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- Modified subgradient extragradient algorithm for pseudomonotone equilibrium problems
- Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods
- Quantitative results on Fejér monotone sequences
- Proximal methods for stationary mean field games with local couplings
- Applications of Mann's method to the split common fixed point problem
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- Compositions and convex combinations of averaged nonexpansive operators
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Generalized conditional gradient with augmented Lagrangian for composite minimization
- Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems
- Split-Douglas-Rachford algorithm for composite monotone inclusions and split-ADMM
- Variable quasi-Bregman monotone sequences
- A proximal gradient splitting method for solving convex vector optimization problems
- Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- A forward-backward splitting method for monotone inclusions without cocoercivity
- Inexact proximal point algorithm for multiobjective optimization
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- A parallel subgradient method extended to variational inequalities involving nonexpansive mappings
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Strong convergence theorems by shrinking projection methods for class \(\mathcal I\) mappings
- Convergence of weighted averages of relaxed projections
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- New demiclosedness principles for (firmly) nonexpansive operators
- Tseng’s Algorithm with Extrapolation from the past Endowed with Variable Metrics and Error Terms
- Implicit regularization with strongly convex bias: Stability and acceleration
- Bounded perturbation resilience of projected scaled gradient methods
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- Modified hybrid steepest-descent methods for variational inequalities and fixed points
- Krasnoselski-Mann iterations for hierarchical fixed point problems for a finite family of nonself mappings in Banach spaces
- A two-phase rank-based algorithm for low-rank matrix completion
- Sharper Bounds for Proximal Gradient Algorithms with Errors
- A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions
- Resilient and constrained consensus against adversarial attacks: a distributed MPC framework
- A new relaxed method for the split feasibility problem in Hilbert spaces
- The geometry of monotone operator splitting methods
- Extragradient method with feasible inexact projection to variational inequality problem
- A subgradient projection method for quasiconvex minimization
This page was built for publication: Quasi-Fejérian analysis of some optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768014)
