Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
From MaRDI portal
Publication:2282820
DOI10.1007/s10589-019-00124-7zbMath1427.90268arXiv1801.08285OpenAlexW2969799340WikidataQ127334347 ScholiaQ127334347MaRDI QIDQ2282820
Publication date: 19 December 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.08285
fast gradient methodminimum norm problemNesterov's smoothing techniqueGilbert's algorithmMinkowski sum of setsSAGA
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Quadratic programming (90C20) Nonsmooth analysis (49J52)
Related Items (26)
Viscosity-type inertial extragradient algorithms for solving variational inequality problems and fixed point problems ⋮ A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space ⋮ A new class of computationally efficient algorithms for solving fixed-point problems and variational inequalities in real Hilbert spaces ⋮ A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems ⋮ Inertial projection and contraction methods for pseudomonotone variational inequalities with non-Lipschitz operators and applications ⋮ A Novel Halpern-type Algorithm for a Monotone Inclusion Problem and a Fixed Points Problem on Hadamard Manifolds ⋮ A new class of inertial algorithms with monotonic step sizes for solving fixed point and variational inequalities ⋮ An inertial subgradient extragradient algorithm for modified variational inclusion problem and mixed equilibrium problem in real Hilbert space ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Convergence rate analysis of proximal gradient methods with applications to composite minimization problems ⋮ Two Inertial extragradient viscosity algorithms for solving variational inequality and fixed point problems ⋮ The distance between convex sets with Minkowski sum structure: application to collision detection ⋮ Self-adaptive inertial extragradient algorithms for solving variational inequality problems ⋮ An iterative method and weak sharp solutions for multitime-type variational inequalities ⋮ A parameterized three-operator splitting algorithm and its expansion ⋮ Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems ⋮ Composite extragradient implicit rule for solving a hierarchical variational inequality with constraints of variational inclusion and fixed point problems ⋮ Improved inertial projection and contraction method for solving pseudomonotone variational inequality problems ⋮ Weak and strong convergence of inertial Tseng's extragradient algorithms for solving variational inequality problems ⋮ Weak and strong convergence theorems for the split common fixed point problem with demicontractive operators ⋮ Unnamed Item ⋮ ON THE STRONG CONVERGENCE OF A PROJECTION-BASED ALGORITHM IN HILBERT SPACES ⋮ AN INERTIAL SHRINKING PROJECTION ALGORITHM FOR SPLIT COMMON FIXED POINT PROBLEMS ⋮ Variational inequalities, variational inclusions and common fixed point problems in Banach spaces ⋮ Strong convergence of inertial forward–backward methods for solving monotone inclusions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Fast projection onto the simplex and the \(l_1\) ball
- Erratum to: ``Minimizing finite sums with the stochastic average gradient
- The solution path of the generalized lasso
- Limiting subgradients of minimal time functions in Banach spaces
- Introductory lectures on convex optimization. A basic course.
- Convex analysis and nonlinear optimization. Theory and examples
- On sums and convex combinations of projectors onto convex sets
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- Algorithms for Fitting the Constrained Lasso
- A New Class of Minimum Norm Duality Theorems
- Finding the nearest point in A polytope
- Finding the Point of a Polyhedron Closest to the Origin
- First-Order Methods in Optimization
- Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems
- Model Selection and Estimation in Regression with Grouped Variables
- Fast Algorithms for Projection on an Ellipsoid
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Convex analysis and global optimization
This page was built for publication: Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
