An MM Algorithm for Split Feasibility Problems

DOI10.48550/ARXIV.1612.05614MaRDI QIDQ150985zbMATH OpenOpenAlexWikidataFDO

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

Publication date 16 December 2016

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

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

zbMATH Keywords

constrained regressionintensity modulated radiation therapymajorize-minimizenonlinear split feasibilityproximity function minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

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.

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

Cites work

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

Cited in

(11)

• MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection
• Quasi-Newton Acceleration of EM and MM Algorithms via Broyden’s Method
• 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
• splitFeas
• Inertial forward-reflected-backward splitting method with linesearch for nonconvex split feasibility problem
• CQ-like algorithm for nonconvex split feasibility problem with multiple output sets
• 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
• A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion

Describes a project that uses

Uses Software

• FASTA
• Ipopt
• R

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)