A dynamical splitting method for minimizing the sum of three convex functions
From MaRDI portal
Recommendations
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- A splitting algorithm for three-block convex minimization problems
- A dynamical system method for solving the split convex feasibility problem
- A splitting method for separable convex programming
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
Cites work
- scientific article; zbMATH DE number 4137253 (Why is no real title available?)
- scientific article; zbMATH DE number 53595 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 917233 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A Novel Neural Network for a Class of Convex Quadratic Minimax Problems
- A continuous dynamical Newton-like approach to solving monotone inclusions
- A dynamic system model for solving convex nonlinear optimization problems
- A dynamical model for solving degenerate quadratic minimax problems with constraints
- A dynamical system associated with the fixed points set of a nonexpansive operator
- A one-layer recurrent neural network for constrained nonconvex optimization
- A proximal neurodynamic model for solving inverse mixed variational inequalities
- A three-operator splitting scheme and its optimization applications
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Computation of non-monotonic Lyapunov functions for continuous-time systems
- Continuous gradient projection method in Hilbert spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
- Dynamical systems and forward-backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator
- Dynamical systems and variational inequalities
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Inexact accelerated augmented Lagrangian methods
- Levenberg-Marquardt dynamics associated to variational inequalities
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence rate of Douglas-Rachford operator splitting method
- On the stability of globally projected dynamical systems
- On weak convergence of the Douglas-Rachford method
- Ordinary differential equations and dynamical systems
- Regularization and Variable Selection Via the Elastic Net
- Robinson's implicit function theorem and its extensions
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
Cited in
(3)
This page was built for publication: A dynamical splitting method for minimizing the sum of three convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5073870)
