Prediction of Breast Cancer through Fast Optimization Techniques Applied to Machine Learning
From MaRDI portal
Cites work
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A note on the CQ algorithm for the split feasibility problem
- A simple look at the method for solving split feasibility problems in Hilbert spaces
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An inertial alternating direction method of multipliers
- An inertial forward-backward algorithm for monotone inclusions
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- An iterative row-action method for interval convex programming
- Convergence analysis of an inertial iterate for the proximal split feasibility problem
- Convergence of a splitting inertial proximal method for monotone operators
- Convex analysis and monotone operator theory in Hilbert spaces
- Data mining. Concepts and techniques
- Double projection algorithms for solving the split feasibility problems
- Extra-gradient methods for solving split feasibility and fixed point problems
- Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- Inertial accelerated algorithms for solving a split feasibility problem
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Matrix p-norms are NP-hard to approximate if p1,2,
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Several inertial methods for solving split convex feasibilities and related problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- The ball-relaxed CQ algorithms for the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(4)- Composite Tseng-type extragradient algorithms with adaptive inertial correction strategy for solving bilevel split pseudomonotone VIP under split common fixed-point constraint
- Solution of a Fredholm integral equation on C^-algebra-valued partial b-metric spaces
- An improved alternating inertial algorithm with adaptive step-sizes for equilibrium problems with data classification experiments
- A self-adaptive regularized splitting algorithm with double inertial terms for solving split monotone variational inclusion problems: application to data classification
This page was built for publication: Prediction of Breast Cancer through Fast Optimization Techniques Applied to Machine Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912896)
