Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
From MaRDI portal
Publication:2515036
DOI10.1007/s10107-013-0741-1zbMath1338.90301OpenAlexW2020532300MaRDI QIDQ2515036
Publication date: 9 February 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0741-1
convex optimizationnonexpansive mappingconjugate gradient methodfixed point setthree-term conjugate gradient methodfixed point optimization algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Programming in abstract spaces (90C48) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Methods of reduced gradient type (90C52)
Related Items
Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings ⋮ On split common fixed point and monotone inclusion problems in reflexive Banach spaces ⋮ Approximation of solutions of the split minimization problem with multiple output sets and common fixed point problems in real Banach spaces ⋮ An extended projected residual algorithm for solving smooth convex optimization problems ⋮ Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings ⋮ Inertial projection methods for finding a minimum-norm solution of pseudomonotone variational inequality and fixed-point problems ⋮ INERTIAL MANN-KRASNOSELSKII ALGORITHM WITH SELF ADAPTIVE STEPSIZE FOR SPLIT VARIATIONAL INCLUSION PROBLEM AND PARAMONOTONE EQUILIBRIA ⋮ An extension of hybrid method without extrapolation step to equilibrium problems ⋮ Halpern subgradient extragradient method extended to equilibrium problems ⋮ Unnamed Item ⋮ On split generalized equilibrium and fixed point problems with multiple output sets in real Banach spaces ⋮ A modified inertial Halpern method for solving split monotone variational inclusion problems in Banach spaces ⋮ Inertial hybrid gradient method with adaptive step size for variational inequality and fixed point problems of multivalued mappings in Banach spaces ⋮ Iterative method for split equilibrium problem and minimization problem via conjugate gradient method ⋮ An inertial iterative algorithm for approximating common solutions to split equalities of some nonlinear optimization problems ⋮ Strong convergent algorithm for finding minimum-norm solutions of quasimonotone variational inequalities with fixed point constraint and application ⋮ An algorithmic approach to solving split common fixed point problems for families of demicontractive operators in Hilbert spaces ⋮ Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets ⋮ Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems ⋮ Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks ⋮ A self adaptive inertial subgradient extragradient algorithm for variational inequality and common fixed point of multivalued mappings in Hilbert spaces ⋮ Strong convergence theorem for split feasibility problems and variational inclusion problems in real Banach spaces ⋮ Fixed point quasiconvex subgradient method ⋮ Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization ⋮ An iterative algorithm for solving variational inequality, generalized mixed equilibrium, convex minimization and zeros problems for a class of nonexpansive-type mappings ⋮ Optimization for Inconsistent Split Feasibility Problems ⋮ An algorithm for a class of bilevel variational inequalities with split variational inequality and fixed point problem constraints ⋮ Modified viscosity implicit rules for proximal split feasibility and fixed point problems ⋮ Decentralized hierarchical constrained convex optimization ⋮ Strong convergence theorems for relatively nonexpansive mappings and Lipschitz-continuous monotone mappings in Banach spaces ⋮ Incremental subgradient method for nonsmooth convex optimization with fixed point constraints ⋮ Modified inertial subgradient extragradient method with self adaptive stepsize for solving monotone variational inequality and fixed point problems ⋮ A modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and fixed point problem in uniformly convex Banach spaces ⋮ Fast relaxed inertial Tseng's method-based algorithm for solving variational inequality and fixed point problems in Hilbert spaces ⋮ Analysis of two variants of an inertial projection algorithm for finding the minimum-norm solutions of variational inequality and fixed point problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Convex analysis and nonlinear optimization. Theory and examples
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Hard-constrained inconsistent signal feasibility problems
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Finding the nearest point in A polytope
- Numerical Optimization
- An Introduction to Variational Inequalities and Their Applications
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- On Projection Algorithms for Solving Convex Feasibility Problems
- Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
