Decomposition through formalization in a product space

From MaRDI portal

Publication:3673556

Jump to:navigation, search

DOI10.1007/BF02612715zbMath0523.49022MaRDI QIDQ3673556

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

projection; convex feasibility problem; product space; splitting-up; method of fractional step

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

52A40: Inequalities and extremum problems involving convexity in convex geometry

49M27: Decomposition methods

52A07: Convex sets in topological vector spaces (aspects of convex geometry)

49M25: Discrete approximations in optimal control

Related Items

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, 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, PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS, Linear convergence rates for extrapolated fixed point algorithms, On the strong convergence of sequences of Halpern type in Hilbert spaces, Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems, Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions, Partial regularization of the sum of two maximal monotone operators, Modular proximal optimization for multidimensional total-variation regularization, Strong convergence of expected-projection methods in hilbert spaces, Unnamed Item, Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, Stochastic block projection algorithms with extrapolation for convex feasibility problems, A splitting method for finding the resolvent of the sum of two maximal monotone operators, Fundamentals of cone regression, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Projection on the intersection of convex sets, Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures, 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?, An extrapolated iterative algorithm for multiple-set split feasibility problem, Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes, Convergence analysis of a parallel projection algorithm for solving convex feasibility problems, Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations, Algorithms for the split variational inequality problem, Hilbertian convex feasibility problem: Convergence of projection methods, Convergence properties of dynamic string-averaging projection methods in the presence of perturbations, A new projection method for finding the closest point in the intersection of convex sets, A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem., Relaxed outer projections, weighted averages and convex feasibility, Local linear convergence for alternating and averaged nonconvex projections, Coincidence points by generalized Mann iterates with applications in Hilbert spaces, Perturbed projections and subgradient projections for the multiple-sets split feasibility problem, Visco-penalization of the sum of two monotone operators, The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets, Metric subregularity and the proximal point method, Decomposition method of descent for minimizing the sum of convex nonsmooth functions, Strong convergence of projection-like methods in Hilbert spaces, On some optimization techniques in image reconstruction from projections, A cyclic projection algorithm via duality, On the convergence of Han's method for convex programming with quadratic objective, On the convergence of von Neumann's alternating projection algorithm for two sets, Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces, A multiprojection algorithm using Bregman projections in a product space, Block-iterative surrogate projection methods for convex feasibility problems, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., About extensions of the extremal principle, Solving graph coloring problems with the Douglas-Rachford algorithm, Some convergence strategies for the alternating generalized projection method, A feasibility approach for constructing combinatorial designs of circulant type, The forward-backward algorithm and the normal problem, Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators, The Douglas-Rachford algorithm in the affine-convex case, Summed squared distance error reduction by simultaneous multiprojections and applications, Generalized Mann iterates for constructing fixed points in Hilbert spaces, Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval, On the method of reflections, The circumcentered-reflection method achieves better rates than alternating projections, Constraint reduction reformulations for projection algorithms with applications to wavelet construction, Error bounds for the method of simultaneous projections with infinitely many subspaces, The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning, On a fast deterministic block Kaczmarz method for solving large-scale linear systems, Circumcentering approximate reflections for solving the convex feasibility problem, 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, An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm, The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, Strengthened splitting methods for computing resolvents, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem, Weak and norm convergence of a parallel projection method in Hilbert spaces, The optimal error bound for the method of simultaneous projections, 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?, Extrapolation algorithm for affine-convex feasibility problems, Set intersection problems: supporting hyperplanes and quadratic programming, On the asymptotic behavior of some alternate smoothing series expansion iterative methods, On the circumcentered-reflection method for the convex feasibility problem, A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting, Convergence of string-averaging method for a class of operators, The rate of convergence in the method of alternating projections, Proximal Splitting Methods in Signal Processing, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, A survey on operator splitting and decomposition of convex programs, Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods, APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples, On the string averaging method for sparse common fixed‐point problems, Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections, Asymmetric variational inequality problems over product sets: Applications and iterative methods, Faster Randomized Block Kaczmarz Algorithms, Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition, Unnamed Item, Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization, A Distributed Boyle--Dykstra--Han Scheme, The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, An acceleration scheme for Dykstra's algorithm, Projection methods for high numerical aperture phase retrieval, On Componental Operators in Hilbert Space, Degenerate Preconditioned Proximal Point Algorithms, 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 dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints, Resolvent and proximal compositions

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3673556&oldid=17148763"