Decomposition through formalization in a product space
From MaRDI portal
Publication:3673556
DOI10.1007/BF02612715zbMATH Open0523.49022OpenAlexW2094508696MaRDI QIDQ3673556FDOQ3673556
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02612715
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
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- The method of projections for finding the common point of convex sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a relaxation method of solving systems of linear inequalities
- Two coordination principles and their application in large scale systems control
- Title not available (Why is that?)
- Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
- Title not available (Why is that?)
- Parametric Optimization by Primal Method in Multilevel Systems
- Title not available (Why is that?)
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- An Application of Linear Programming to Curve Fitting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symmetrized Separable Convex Programming
Cited In (only showing first 100 items - show all)
- Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
- On the string averaging method for sparse common fixed‐point problems
- 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 Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem
- 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
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- 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
- Coincidence points by generalized Mann iterates with applications in Hilbert spaces
- On the strong convergence of sequences of Halpern type in Hilbert spaces
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- The forward-backward algorithm and the normal problem
- On the asymptotic behavior of some alternate smoothing series expansion iterative methods
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
- Fundamentals of cone regression
- An extrapolated iterative algorithm for multiple-set split feasibility problem
- Title not available (Why is that?)
- Generalized Mann iterates for constructing fixed points in Hilbert spaces
- 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
- Local linear convergence for alternating and averaged nonconvex projections
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Hilbertian convex feasibility problem: Convergence of projection methods
- Strong convergence of projection-like methods in Hilbert spaces
- Visco-penalization of the sum of two monotone operators
- Relaxed outer projections, weighted averages and convex feasibility
- On Componental Operators in Hilbert Space
- Projection on the intersection of convex sets
- 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
- An acceleration scheme for Dykstra's algorithm
- A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
- Proximal Splitting Methods in Signal Processing
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- A survey on operator splitting and decomposition of convex programs
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting
- The Douglas-Rachford algorithm in the affine-convex case
- Projection methods for high numerical aperture phase retrieval
- How good are extrapolated bi-projection methods for linear feasibility problems?
- Metric subregularity and the proximal point method
- Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- The rate of convergence in the method of alternating projections
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- Set intersection problems: supporting hyperplanes and quadratic programming
- Error bounds for the method of simultaneous projections with infinitely many subspaces
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures
- Degenerate Preconditioned Proximal Point Algorithms
- How good are projection methods for convex feasibility problems?
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
- Strong convergence of expected-projection methods in hilbert spaces
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
- Partial regularization of the sum of two maximal monotone operators
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
- 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
- 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
- A Distributed Boyle--Dykstra--Han Scheme
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- Regularity of sets under a reformulation in a product space with reduced dimension
- Faster Randomized Block Kaczmarz Algorithms
- Linear convergence rates for extrapolated fixed point algorithms
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- A finitely convergent circumcenter method for the convex feasibility problem
- Convergence of string-averaging method for a class of operators
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
- A feasibility approach for constructing combinatorial designs of circulant type
- The geometry of monotone operator splitting methods
- Title not available (Why is that?)
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Modular proximal optimization for multidimensional total-variation regularization
- Resolvent and proximal compositions
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- Strengthened splitting methods for computing resolvents
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Some convergence strategies for the alternating generalized projection method
- Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval
- Weak and norm convergence of a parallel projection method in Hilbert spaces
- The circumcentered-reflection method achieves better rates than alternating projections
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)
