Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/a-generalized-projection-based-scheme-for-solving-convex-constrained-vClgD6VLmE
References (89)
-
A. Pierro, E. Neto (2009)
From convex feasibility to convex constrained optimization using block action projection methods and underrelaxationInt. Trans. Oper. Res., 16
-
KC Kiwiel (1996)
The efficiency of subgradient projection methods for convex optimization, part I: general level methods and part II: implementations and extensionsSIAM J. Control Optim., 34
-
Y. Censor, S. Zenios (1991)
Interval-constrained matrix balancingLinear Algebra and its Applications, 150
-
P. Combettes, Jianxue Luo (2002)
An adaptive level set method for nondifferentiable constrained image recoveryIEEE transactions on image processing : a publication of the IEEE Signal Processing Society, 11 11
-
K. Kiwiel (1996)
The efficiency of subgradient projection methods for convex optimization, part I: general level methodsSiam Journal on Control and Optimization, 34
-
A. Pierro, A. Iusem (1988)
A finitely convergent “row-action” method for the convex feasibility problemApplied Mathematics and Optimization, 17
-
A. Cegielski (1999)
A method of projection onto an acute cone with level control in convex minimizationMathematical Programming, 85
-
Y. Censor (1997)
Parallel Optimization:theory -
Y. Censor, Wei Chen, P. Combettes, R. Davidi, G. Herman (2009)
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraintsComputational Optimization and Applications, 51
-
Daniel Reem, Alvaro Pierro (2015)
A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errorsInverse Problems, 33
-
Sehun Kim, Hyunsil Ahn, Seong-Cheol Cho (1991)
Variable target value subgradient methodMathematical Programming, 49
-
NEW PROJECTION-BASED SCHEME -
Y. Censor, T. Elfving, Nirit Kopf, T. Bortfeld (2005)
The multiple-sets split feasibility problem and its applications for inverse problemsInverse Problems, 21
-
D. Bertsekas (1995)
Nonlinear Programming -
Wei Chen, D. Craft, T. Madden, K. Zhang, H. Kooy, G. Herman (2010)
A fast optimization algorithm for multicriteria intensity modulated proton therapy planning.Medical physics, 37 9
-
Hector Rosales-Macedo (1993)
Nonlinear Programming: Theory and Algorithms (2nd Edition)Journal of the Operational Research Society, 45
-
Stephen Boyd, Jaehyun Park (2007)
Subgradient Methods -
C. Pang (2013)
SHDQP: An algorithm for convex set intersection problems based on supporting hyperplanes and dual quadratic programmingarXiv: Optimization and Control
-
R. Gordon, R. Bender, G. Herman (1970)
Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography.Journal of theoretical biology, 29 3
-
(2013)
CoinUtils package availble from https -
Y. Censor, G. Herman, M. Jiang (2017)
Superiorization: theory and applicationsInverse Problems, 33
-
GT Herman, L Meyer (1993)
Algebraic reconstruction techniques can be made computationally efficientIEEE Trans. Med. Imaging, 12
-
Y. Censor (2014)
Weak and Strong Superiorization: Between Feasibility-Seeking and MinimizationAnalele Universitatii "Ovidius" Constanta - Seria Matematica, 23
-
G. Herman (2014)
Superiorization for Image Analysis -
I. Maros, C. Mészáros (1999)
A repository of convex quadratic programming problemsOptimization Methods & Software, 11
-
C. Pang (2012)
Set intersection problems: supporting hyperplanes and quadratic programmingMathematical Programming, 149
-
Y. Censor, Wei Chen, H. Pajoohesh (2011)
Finite Convergence of a Subgradient Projections Method with Expanding ControlsApplied Mathematics & Optimization, 64
-
Dennis Amelunxen (2011)
Geometric analysis of the condition of the convex feasibility problem -
A. Stachurski (2000)
Parallel Optimization: Theory, Algorithms and ApplicationsScalable Comput. Pract. Exp., 3
-
Y. Censor, E. Tom (2003)
Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility ProblemsOptimization Methods and Software, 18
-
A. Hero, D. Blatt (2005)
Sensor network source localization via projection onto convex sets (POCS)Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 3
-
I. Konnov (1998)
A combined relaxation method for variational inequalities with nonlinear constraintsMathematical Programming, 80
-
Y. Censor, Daniel Reem (2014)
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methodsMathematical Programming, 152
-
R. Khabibullin (1987)
A method to find a point of a convex setJournal of Soviet Mathematics, 39
-
Leon Hirsch (2016)
Fundamentals Of Convex Analysis -
(1937)
Angenöherte Auflösung von Systemen linearer Gleichungen, Bulletin de l'Académie Polonaise des -
Y. Censor, Y. Zur (2016)
Linear Superiorization for Infeasible Linear Programming -
G. Herman, E. Garduño, R. Davidi, Y. Censor (2012)
Superiorization: An optimization heuristic for medical physicsMedical physics, 39 9
-
(1977)
Translated from Issledovaniya po Prikladnoi Matematike -
A. Cetin, H. Ozaktas, H. Ozaktas (2003)
Resolution enhancement of low resolution wavefields with POCS algorithmElectronics Letters, 39
-
M. Yamagishi, I. Yamada (2008)
A Deep Monotone Approximation Operator Based on the Best Quadratic Lower Bound of Convex FunctionsIEICE Trans. Fundam. Electron. Commun. Comput. Sci., 91-A
-
Heinz Bauschke, J. Borwein (1996)
On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Rev., 38
-
Y. Censor, A. Lent (1982)
Cyclic subgradient projectionsMathematical Programming, 24
-
E. Polak, D. Mayne (1979)
On the finite solution of nonlinear inequalitiesIEEE Transactions on Automatic Control, 24
-
(1938)
Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari -
AN Iusem, L Moledo (1987)
On finitely convergent iterative methods for the convex feasibility problemBull. Braz. Math. Soc., 18
-
Y. Censor, M. Altschuler, W. Powlis (1988)
On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planningInverse Problems, 4
-
D. Butnariu, R. Davidi, G. Herman, I. Kazantsev (2007)
Stable Convergence Behavior Under Summable Perturbations of a Class of Projection Methods for Convex Feasibility and Optimization ProblemsIEEE Journal of Selected Topics in Signal Processing, 1
-
C. Lemaréchal, A. Nemirovski, Y. Nesterov (1995)
New variants of bundle methodsMathematical Programming, 69
-
S. Boyd, L. Vandenberghe (2007)
Localization and Cutting-Plane Methods -
A. Scherrer, F. Yaneva, T. Grebe, K. Küfer (2014)
A new mathematical approach for handling DVH criteria in IMRT planningJournal of Global Optimization, 61
-
C. Byrne (1999)
Iterative projection onto convex sets using multiple Bregman distancesInverse Problems, 15
-
J. Goffin, Z. Luo, Y. Ye (1996)
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility ProblemsSIAM J. Optim., 6
-
A. Cegielski, R. Dylewski (2002)
Selection strategies in projection methods for convex minimization problemsDiscussiones Mathematicae. Differential Inclusions, Control and Optimization, 22
-
M. Bazaraa, C. HanifD.Sherali, M. Shetty (2019)
Nonlinear Programming: Theory and Algorithms, 3/E. -
J. Goffin, K. Kiwiel (1999)
Convergence of a simple subgradient level methodMathematical Programming, 85
-
Y. Censor, R. Davidi, G. Herman (2010)
Perturbation resilience and superiorization of iterative algorithmsInverse Problems, 26
-
A. Cegielski, R. Dylewski (2003)
Residual Selection in A Projection Method for Convex Minimization ProblemsOptimization, 52
-
A. Kulikov, V. Fazylov (1989)
A finite method to find a point in a set defined by a convex differentiable functionalJournal of Soviet Mathematics, 45
-
D. Mayne, E. Polak, A. Heunis (1981)
Solving nonlinear inequalities in a finite number of iterationsJournal of Optimization Theory and Applications, 33
-
K. Küfer, M. Monz, A. Scherrer, P. Süss, Fernando Alonso, Ahmad Sultan, T. Bortfeld, C. Thieke (2009)
Multicriteria Optimization in Intensity Modulated Rediotherapy Planning -
(2017)
and M -
S Kaczmarz (1937)
Angenöherte Auflösung von Systemen linearer GleichungenBulletin de l’Académie Polonaise des Sciences at Lettres A, 35
-
Superiorization and Perturbation Resilience of Algorithms: A Bibliography compiled and continuously updated by Yair Censor -
G. Ovuworie, M. Bazaraa, C. Shetty (2013)
NONLINEAR PROGRAMMING Theory and Algorithms -
G. Herman, Lorraine Meyer (1993)
Algebraic reconstruction techniques can be made computationally efficient [positron emission tomography application]IEEE transactions on medical imaging, 12 3
-
J. Tiel (1984)
Convex Analysis: An Introductory Text -
LG Gubin, BT Polyak, EV Raik (1967)
The method of projections for finding a common point of convex setsComput. Math. Math. Phys., 7
-
R. Khabibullin (1987)
Generalized descent method for minimization of functionalsJournal of Soviet Mathematics, 39
-
D. Blatt, A. Hero (2005)
Energy-based sensor network source localization via projection onto convex setsIEEE Transactions on Signal Processing, 54
-
Y. Censor, A. Cegielski (2014)
Projection methods: an annotated bibliography of books and reviewsOptimization, 64
-
K. Kiwiel (1996)
The Efficiency of Subgradient Projection Methods for Convex Optimization -
C. Byrne (2004)
A unified treatment of some iterative algorithms in signal processing and image reconstructionInverse Problems, 20
-
S. Agmon (1954)
The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 6
-
A. Iusem, L. Moledo (1987)
On finitely convergent iterative methods for the convex feasibility problemBoletim da Sociedade Brasileira de Matemática - Bulletin/Brazilian Mathematical Society, 18
-
Heinz Bauschke, P. Combettes (2011)
Convex Analysis and Monotone Operator Theory in Hilbert Spaces -
J. Elzinga, T. Moore (1975)
A central cutting plane algorithm for the convex programming problemMathematical Programming, 8
-
Heinz Bauschke, Valentin Koch (2013)
Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with HalfspacesarXiv: Optimization and Control
-
S. Zenios, Y. Censor (1991)
Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation ProblemsSIAM J. Optim., 1
-
L. Gubin, Boris Polyak, É. Raik (1967)
The method of projections for finding the common point of convex setsUssr Computational Mathematics and Mathematical Physics, 7
-
M. Fukushima (1982)
A finitely convergent algorithm for convex inequalitiesIEEE Transactions on Automatic Control, 27
-
E-mail address: [email protected] (P. Süss) Optimization Department, Fraunhofer -ITWM -
J. Kelley (1960)
The Cutting-Plane Method for Solving Convex ProgramsJournal of The Society for Industrial and Applied Mathematics, 8
-
B. Wyk, M. Wyk (2004)
A POCS-Based Graph Matching AlgorithmIEEE Trans. Pattern Anal. Mach. Intell., 26
-
D. Butnariu, Y. Censor, P. Gurfil, E. Hadar (2008)
On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean SpacesSIAM journal on optimization : a publication of the Society for Industrial and Applied Mathematics, 19 2
-
J. Chinneck (2007)
Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods -
Stephen Boyd, L. Vandenberghe (2005)
Convex OptimizationJournal of the American Statistical Association, 100
-
Karmiel 2161002, Israel E-mail address: [email protected] (K.-H. Küfer) Optimization Department, Fraunhofer -ITWM, Kaiserslautern 67663, Germany E-mail address -
G. Herman, Wei Chen (2008)
A fast algorithm for solving a linear feasibility problem with application to Intensity-Modulated Radiation Therapy.Linear algebra and its applications, 428 5-6
- Publisher
- Springer Journals
- Copyright
- Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
- Subject
- Mathematics; Optimization; Operations Research, Management Science; Operations Research/Decision Theory; Statistics, general; Convex and Discrete Geometry
- ISSN
- 0926-6003
- eISSN
- 1573-2894
- DOI
- 10.1007/s10589-018-9991-4
- Publisher site
- See Article on Publisher Site
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.
Journal
Computational Optimization and Applications – Springer Journals
Published: Mar 2, 2018