An MM Algorithm for Split Feasibility Problems

DOI10.48550/ARXIV.1612.05614zbMATH Open1416.90048arXiv1612.05614OpenAlexW2885174950WikidataQ129479545 ScholiaQ129479545MaRDI QIDQ150985FDOQ150985

Kenneth Lange, Meng Yang, Jason Xu, Kenneth Lange, Meng Yang, Jason Xu, Eric C. Chi, Eric C. Chi

Publication date: 16 December 2016

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Abstract: The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range constraints. Split feasibility generalizes important inverse problems including convex feasibility, linear complementarity, and regression with constraint sets. When a feasible point does not exist, solution methods that proceed by minimizing a proximity function can be used to obtain optimal approximate solutions to the problem. We present an extension of the proximity function approach that generalizes the linear split feasibility problem to allow for non-linear mappings. Our algorithm is based on the principle of majorization-minimization, is amenable to quasi-Newton acceleration, and comes complete with convergence guarantees under mild assumptions. Furthermore, we show that the Euclidean norm appearing in the proximity function of the non-linear split feasibility problem can be replaced by arbitrary Bregman divergences. We explore several examples illustrating the merits of non-linear formulations over the linear case, with a focus on optimization for intensity-modulated radiation therapy.

Full work available at URL: https://arxiv.org/abs/1612.05614

Recommendations

• A gradient algorithm for finding minimum-norm solution of the split feasibility problem
• The split feasibility problem and its solution algorithm
• A new algorithm for the split feasibility problem
• Implicit and explicit algorithms for solving the split feasibility problem
• An unconstrained optimization approach to the split feasibility problem
• A modified algorithm for solving the split feasibility problem
• scientific article; zbMATH DE number 7267225
• A new extragradient-type algorithm for the split feasibility problem
• The problem of split convex feasibility and its alternating approximation algorithms
• scientific article; zbMATH DE number 6285844

zbMATH Keywords

constrained regressionintensity modulated radiation therapymajorize-minimizenonlinear split feasibilityproximity function minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variational Analysis
• Regularization and Variable Selection Via the Elastic Net
• MM optimization algorithms
• A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
• L 1-Regularization Path Algorithm for Generalized Linear Models
• Optimization
• Proximal algorithms in statistics and machine learning
• Title not available (Why is that?)
• A quasi-Newton acceleration for high-dimensional optimization algorithms
• Numerical Analysis for Statisticians
• Title not available (Why is that?)
• A multiprojection algorithm using Bregman projections in a product space
• Alternating minimization as sequential unconstrained minimization: a survey
• General method for solving the split common fixed point problem
• Linear and nonlinear programming
• Penalized likelihood regression for generalized linear models with non-quadratic penalties
• Hard-constrained inconsistent signal feasibility problems
• Weak and strong superiorization: between feasibility-seeking and minimization
• The linearized Bregman method via split feasibility problems: analysis and generalizations
• Solving a Generalized Heron Problem by Means of Convex Analysis
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Algorithms for Nonnegative Matrix Factorization with the β-Divergence
• Applications of variational analysis to a generalized Heron problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Title not available (Why is that?)
• Distance majorization and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Iterative oblique projection onto convex sets and the split feasibility problem
• ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
• Sparse Reconstruction by Separable Approximation
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Optimizing the Delivery of Radiation Therapy to Cancer Patients
• Title not available (Why is that?)
• Iterative projection onto convex sets using multiple Bregman distances
• A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization
• A note on the split common fixed-point problem for quasi-nonexpansive operators
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• A note on the multiple-set split convex feasibility problem in Hilbert space
• Sequential unconstrained minimization algorithms for constrained optimization
• Signal Recovery by Proximal Forward-Backward Splitting
• Mathematical optimization in intensity modulated radiation therapy
• Algorithms for the split variational inequality problem
• A generalized projection-based scheme for solving convex constrained optimization problems
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem

Cited In (7)

• MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection
• A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
• A hyper-transformer model for controllable Pareto front learning with split feasibility constraints
• On inertial non-Lipschitz stepsize algorithms for split feasibility problems
• The multiple-sets split feasibility problem and its applications for inverse problems
• Non-convex split Feasibility problems: models, algorithms and theory
• splitFeas

Uses Software

• R
• Ipopt
• FASTA

This page was built for publication: An MM Algorithm for Split Feasibility Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q150985)