A generalized projection-based scheme for solving convex constrained optimization problems
From MaRDI portal
Abstract: In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility problems by iteratively constraining the objective function from above until the feasibility problem is inconsistent. For each of the feasibility problems one may apply any of the existing projection methods for solving it. In particular, the scheme allows the use of subgradient projections and does not require exact projections onto the constraints sets as in existing similar methods. We also apply the newly introduced concept of superiorization to optimization formulation and compare its performance to our scheme. We provide some numerical results for convex quadratic test problems as well as for real-life optimization problems coming from medical treatment planning.
Recommendations
- scientific article; zbMATH DE number 4030852
- A new generalized gradient projection method for general constrained optimization
- An improved gradient projection method for constrained optimization problems
- A generalized gradient projection algorithm of optimization with nonlinear constraints
- Projection algorithms for solving generalized nonconvex variational inequalities
- A projected PRP method for optimization with convex constraint
- Projection-iteration methods for solving constrained minimization problems
- A conjugate gradient projection method for solving equations with convex constraints
- scientific article; zbMATH DE number 3968343
- A projection-proximal point algorithm for solving generalized variational inequalities
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- scientific article; zbMATH DE number 3029984 (Why is no real title available?)
- A central cutting plane algorithm for the convex programming problem
- A combined relaxation method for variational inequalities with nonlinear constraints
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- A finite method to find a point in a set defined by a convex differentiable functional
- A finitely convergent ``row-action method for the convex feasibility problem
- A finitely convergent algorithm for convex inequalities
- A method of projection onto an acute cone with level control in convex minimization
- A method to find a point of a convex set
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- A new mathematical approach for handling DVH criteria in IMRT planning
- A repository of convex quadratic programming problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convergence of a simple subgradient level method
- Convex analysis and monotone operator theory in Hilbert spaces
- Cyclic subgradient projections
- Energy-based sensor network source localization via projection onto convex sets
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Finite convergence of a subgradient projections method with expanding controls
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- Generalized descent method for minimization of functionals
- Interval-constrained matrix balancing
- Iterative projection onto convex sets using multiple Bregman distances
- Linear superiorization for infeasible linear programming
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- New variants of bundle methods
- Nonlinear Programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
- On finitely convergent iterative methods for the convex feasibility problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- On the finite solution of nonlinear inequalities
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Perturbation resilience and superiorization of iterative algorithms
- Preface: Superiorization: theory and applications
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- Projection methods: an annotated bibliography of books and reviews
- Residual Selection in A Projection Method for Convex Minimization Problems
- Selection strategies in projection methods for convex minimization problems
- Set intersection problems: supporting hyperplanes and quadratic programming
- Solving nonlinear inequalities in a finite number of iterations
- The Cutting-Plane Method for Solving Convex Programs
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The method of projections for finding the common point of convex sets
- The multiple-sets split feasibility problem and its applications for inverse problems
- Variable target value subgradient method
- Weak and strong superiorization: between feasibility-seeking and minimization
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
Cited in
(17)- A new modified extragradient method with line-search process for solving pseudomonotone variational inequality in Hilbert spaces
- Stability of the asymptotic behavior for continuous descent methods with a convex objective function
- An MM Algorithm for Split Feasibility Problems
- scientific article; zbMATH DE number 7753396 (Why is no real title available?)
- A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces
- Nesterov perturbations and projection methods applied to IMRT
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- A Projection-Based Algorithm for Consistent and Inconsistent Constraints
- scientific article; zbMATH DE number 4101955 (Why is no real title available?)
- scientific article; zbMATH DE number 7201315 (Why is no real title available?)
- A novel method for hierarchical variational inequality with split common fixed point constraint
- Two-Metric Projection Methods for Constrained Optimization
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Descent methods with computational errors in Banach spaces
- Two iterative processes generated by regular vector fields in 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
- The combination projection method for solving convex feasibility problems
This page was built for publication: A generalized projection-based scheme for solving convex constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721952)
