Decomposition through formalization in a product space

DOI10.1007/BF02612715zbMath0523.49022OpenAlexW2094508696MaRDI QIDQ3673556

Guy Pierra

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02612715

zbMATH Keywords

projectionconvex feasibility problemproduct spacesplitting-upmethod of fractional step

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Inequalities and extremum problems involving convexity in convex geometry (52A40) Decomposition methods (49M27) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Discrete approximations in optimal control (49M25)

Related Items (only showing first 100 items - show all)

Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Polynomial estimates for the method of cyclic projections in Hilbert spaces ⋮ A Distributed Boyle--Dykstra--Han Scheme ⋮ On the centralization of the circumcentered-reflection method ⋮ Regularity of sets under a reformulation in a product space with reduced dimension ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Resolvent and proximal compositions ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ Centering projection methods for wavelet feasibility problems ⋮ Strict pseudocontractions and demicontractions, their properties, and applications ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ Unnamed Item ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Faster Randomized Block Kaczmarz Algorithms ⋮ Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition ⋮ Unnamed Item ⋮ The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem ⋮ Projection methods for high numerical aperture phase retrieval ⋮ On Componental Operators in Hilbert Space ⋮ Degenerate Preconditioned Proximal Point Algorithms ⋮ Asymmetric variational inequality problems over product sets: Applications and iterative methods ⋮ Weak and norm convergence of a parallel projection method in Hilbert spaces ⋮ The rate of convergence in the method of alternating projections ⋮ Fundamentals of cone regression ⋮ Proximal Splitting Methods in Signal Processing ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Strong convergence of projection-like methods in Hilbert spaces ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ Local linear convergence for alternating and averaged nonconvex projections ⋮ Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces ⋮ Circumcentering approximate reflections for solving the convex feasibility problem ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ Coincidence points by generalized Mann iterates with applications in Hilbert spaces ⋮ Projection on the intersection of convex sets ⋮ About extensions of the extremal principle ⋮ PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ On the asymptotic behavior of some alternate smoothing series expansion iterative methods ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ Some convergence strategies for the alternating generalized projection method ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ On some optimization techniques in image reconstruction from projections ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes ⋮ A product space reformulation with reduced dimension for splitting algorithms ⋮ Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ A cyclic projection algorithm via duality ⋮ The optimal error bound for the method of simultaneous projections ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Distributed solutions for loosely coupled feasibility problems using proximal splitting methods ⋮ Strong convergence of expected-projection methods in hilbert spaces ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ How good are projection methods for convex feasibility problems? ⋮ Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ How good are extrapolated bi-projection methods for linear feasibility problems? ⋮ A survey on operator splitting and decomposition of convex programs ⋮ An extrapolated iterative algorithm for multiple-set split feasibility problem ⋮ A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters ⋮ Solving stochastic convex feasibility problems in hilbert spaces ⋮ Algorithms for the split variational inequality problem ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes ⋮ On the convergence of Han's method for convex programming with quadratic objective ⋮ Strengthened splitting methods for computing resolvents ⋮ Visco-penalization of the sum of two monotone operators ⋮ Convergence analysis of a parallel projection algorithm for solving convex feasibility problems ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Unnamed Item ⋮ On the strong convergence of sequences of Halpern type in Hilbert spaces ⋮ Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations ⋮ On the string averaging method for sparse common fixed‐point problems ⋮ Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ A feasibility approach for constructing combinatorial designs of circulant type ⋮ The forward-backward algorithm and the normal problem ⋮ Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems ⋮ Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings ⋮ Quadratic optimization of fixed points of nonexpansive mappings in hubert space ⋮ Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions ⋮ Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval ⋮ Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators ⋮ The Douglas-Rachford algorithm in the affine-convex case ⋮ The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets ⋮ Partial regularization of the sum of two maximal monotone operators ⋮ On the method of reflections ⋮ Set intersection problems: supporting hyperplanes and quadratic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two coordination principles and their application in large scale systems control
• An Application of Linear Programming to Curve Fitting
• Symmetrized Separable Convex Programming
• Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
• Monotone Operators and the Proximal Point Algorithm
• Parametric Optimization by Primal Method in Multilevel Systems
• The method of projections for finding the common point of convex sets
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
• On a relaxation method of solving systems of linear inequalities

This page was built for publication: Decomposition through formalization in a product space