Decomposition through formalization in a product space
From MaRDI portal
(Redirected from Publication:3673556)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Discrete approximations in optimal control (49M25) Decomposition methods (49M27) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites work
- scientific article; zbMATH DE number 3519825 (Why is no real title available?)
- scientific article; zbMATH DE number 3539991 (Why is no real title available?)
- scientific article; zbMATH DE number 3441151 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3296898 (Why is no real title available?)
- scientific article; zbMATH DE number 3338134 (Why is no real title available?)
- scientific article; zbMATH DE number 3354114 (Why is no real title available?)
- scientific article; zbMATH DE number 3385442 (Why is no real title available?)
- An Application of Linear Programming to Curve Fitting
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
- Monotone Operators and the Proximal Point Algorithm
- On a relaxation method of solving systems of linear inequalities
- Parametric Optimization by Primal Method in Multilevel Systems
- Symmetrized Separable Convex Programming
- The method of projections for finding the common point of convex sets
- Two coordination principles and their application in large scale systems control
Cited in
(only showing first 100 items - show all)- Non-monotoneous parallel iteration for solving convex feasibility problems.
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
- Solving stochastic convex feasibility problems in hilbert spaces
- Forward-backward algorithms devised by graphs
- On the circumcentered-reflection method for the convex feasibility problem
- Set intersection problems: supporting hyperplanes and quadratic programming
- Accelerated under-relaxed parallel projection algorithms for convex set theoretic image recovery problem
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures
- Error bounds for the method of simultaneous projections with infinitely many subspaces
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- How good are projection methods for convex feasibility problems?
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
- Degenerate Preconditioned Proximal Point Algorithms
- Strong convergence of expected-projection methods in hilbert spaces
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
- Efficient randomized block Kaczmarz method for linear feasibility
- Partial regularization of the sum of two maximal monotone operators
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- Extrapolation algorithm for affine-convex feasibility problems
- On the method of reflections
- Unconstrained optimization techniques for the acceleration of alternating projection methods
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- Block-iterative surrogate projection methods for convex feasibility problems
- On some optimization techniques in image reconstruction from projections
- Algorithms for the split variational inequality problem
- Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Circumcentered reflections method for wavelet feasibility problems
- On the centralization of the circumcentered-reflection method
- A Distributed Boyle--Dykstra--Han Scheme
- Asymmetric variational inequality problems over product sets: Applications and iterative methods
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- A new projection method for finding the closest point in the intersection of convex sets
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- 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
- 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
- About extensions of the extremal principle
- Regularity of sets under a reformulation in a product space with reduced dimension
- A multiprojection algorithm using Bregman projections in a product space
- Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Linear convergence rates for extrapolated fixed point algorithms
- Coincidence points by generalized Mann iterates with applications in Hilbert spaces
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
- The forward-backward algorithm and the normal problem
- On the strong convergence of sequences of Halpern type in Hilbert spaces
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- A finitely convergent circumcenter method for the convex feasibility problem
- On the asymptotic behavior of some alternate smoothing series expansion iterative methods
- Convergence of string-averaging method for a class of operators
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Proximal splitting methods in signal processing
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
- Fundamentals of cone regression
- A feasibility approach for constructing combinatorial designs of circulant type
- An extrapolated iterative algorithm for multiple-set split feasibility problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Generalized Mann iterates for constructing fixed points in Hilbert spaces
- Local linear convergence for alternating and averaged nonconvex projections
- The geometry of monotone operator splitting methods
- Hilbertian convex feasibility problem: Convergence of projection methods
- Splitting the conditional gradient algorithm
- Strong convergence of projection-like methods in Hilbert spaces
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Modular proximal optimization for multidimensional total-variation regularization
- Visco-penalization of the sum of two monotone operators
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Strengthened splitting methods for computing resolvents
- Relaxed outer projections, weighted averages and convex feasibility
- Resolvent and proximal compositions
- New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- Projection on the intersection of convex sets
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- On Componental Operators in Hilbert Space
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Some convergence strategies for the alternating generalized projection method
- Summed squared distance error reduction by simultaneous multiprojections and applications
- A cyclic projection algorithm via duality
- On the convergence of Han's method for convex programming with quadratic objective
- Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval
- A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
- Application of projection algorithms to differential equations: boundary value problems
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Weak and norm convergence of a parallel projection method in Hilbert spaces
- Faster randomized block Kaczmarz algorithms
- An acceleration scheme for Dykstra's algorithm
This page was built for publication: Decomposition through formalization in a product space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673556)
