A generalized projection-based scheme for solving convex constrained optimization problems
From MaRDI portal
Publication:721952
DOI10.1007/s10589-018-9991-4zbMath1393.90084arXiv1803.05617OpenAlexW2792534692MaRDI QIDQ721952
Karl-Heinz Küfer, Philipp Süss, Aviv Gibali, Daniel Reem
Publication date: 20 July 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.05617
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical methods for variational inequalities and related problems (65K15)
Related Items
The combination projection method for solving convex feasibility problems, Two iterative processes generated by regular vector fields in Banach spaces, A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces, Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces, A new modified extragradient method with line-search process for solving pseudomonotone variational inequality in Hilbert spaces, Descent methods with computational errors in Banach spaces, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy, Nesterov perturbations and projection methods applied to IMRT, Unnamed Item, An MM Algorithm for Split Feasibility Problems, A generalized block-iterative projection method for the common fixed point problem induced by cutters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Finite convergence of a subgradient projections method with expanding controls
- Interval-constrained matrix balancing
- A finitely convergent ``row-action method for the convex feasibility problem
- A method to find a point of a convex set
- A finite method to find a point in a set defined by a convex differentiable functional
- Solving nonlinear inequalities in a finite number of iterations
- Variable target value subgradient method
- Convergence of a simple subgradient level method
- A combined relaxation method for variational inequalities with nonlinear constraints
- A method of projection onto an acute cone with level control in convex minimization
- Generalized descent method for minimization of functionals
- New variants of bundle methods
- A new mathematical approach for handling DVH criteria in IMRT planning
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Set intersection problems: supporting hyperplanes and quadratic programming
- Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Linear Superiorization for Infeasible Linear Programming
- The Cutting-Plane Method for Solving Convex Programs
- The multiple-sets split feasibility problem and its applications for inverse problems
- Projection methods: an annotated bibliography of books and reviews
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- Perturbation resilience and superiorization of iterative algorithms
- On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Cyclic subgradient projections
- A finitely convergent algorithm for convex inequalities
- On finitely convergent iterative methods for the convex feasibility problem
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- A central cutting plane algorithm for the convex programming problem
- On the finite solution of nonlinear inequalities
- Residual Selection in A Projection Method for Convex Minimization Problems
- Selection strategies in projection methods for convex minimization problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A repository of convex quadratic programming problems
- Energy-based sensor network source localization via projection onto convex sets
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Iterative projection onto convex sets using multiple Bregman distances
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Superiorization: theory and applications
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
- Nonlinear Programming
- The method of projections for finding the common point of convex sets
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Convex analysis and monotone operator theory in Hilbert spaces
